Target 1 — the Born rule: reductions and a no-go
Born rule
← all targets · ← Target 3 · Target 2 →
Target 1 — the Born rule: reductions and a no-go
finite_noCollapseBorn_fromNoncontextuality
No-collapse Born representation with the single-trial law DERIVED (not assumed). Given the prize ensemble PLUS non-contextuality of the single-trial statistics (the law p is the value of a non-contextual effect assignment M on a measurement {Pₐ}), there is a density matrix ρ such that: (i) every world has a UNIQUE actual pointer-value history (capacity + selector, no collapse); (ii) the single-trial law is the Born weight Re tr(ρ Pₐ) — FORCED by effect-Gleason; (iii) the world-mass of each history is the Born PRODUCT law; (iv) atypical-frequency histories carry vanishing world-mass. The Born weights are no longer a free parameter — only NON-CONTEXTUALITY + independence (+ the world measure) are assumed.
finite_noCollapseBorn_fromNoncontextuality · capstone — there is ρ such that all of:
- ρ.PosSemidef
- ρ.trace=1
- (∀(ω:E.Ω),∃!h,∀(t:Finn),∃r∈(E.Vωt).config.active,(E.Vωt).ctx.valueOfr=ht)
- (∀(a:Finm),E.pa=(ρ⋅Pa).trace.re)
- (∀(h:Finn→Finm),E.P.massSet{ω∣E.actualHistω=h}=wE.ph)
- E.P.massSet{ω∣(n⋅ε)2≤(countk(E.actualHistω)−n⋅E.pk)2}≤E.pk⋅(1−E.pk)/(n⋅ε2)
assuming
hP IsEffect(Pa)
hε 0<ε
hn 0<n
plus 1 routine conditions (1 bridge) — full list in the per-track PDF.
finite_effect_gleason
finite_effect_gleason · spine — there is ρ such that all of:
- ρ.PosSemidef
- ρ.trace=1
- ∀(E:Mat(Find)(Find)C),IsEffectE→(m.μE)=(ρ⋅E).trace
positive_ray_certain_forces_born
positive_ray_certain_forces_born · spine — we have
wE=bornψE
assuming
hψ ψ∗⋅vψ=1
hadd w(A+B)=wA+wB
hhom w(c⋅A)=c⋅wA
hpsd NonnegC(w(A.conjTranspose⋅A))
hone w1=1
plus 1 routine conditions (1 bridge) — full list in the per-track PDF.
continuous_additive_fMeasure_eq_born
continuous_additive_fMeasure_eq_born · spine — we have
fMeasure(f)wk=wk
assuming
hf Continuousf
h1 f1=0
plus 1 routine conditions (1 setup) — full list in the per-track PDF.
decoherent_partition_additive
decoherent_partition_additive · spine — we have
bornψ((∑aSCa).conjTranspose⋅∑aSCa)=∑aSbornψ((Ca).conjTranspose⋅Ca)
assuming
hdec DecoherentψC
finite_noCollapseBornRepresentation
finite_noCollapseBornRepresentation · spine — we have all of:
- (∀(ω:E.Ω),∃!h,∀(t:Finn),∃r∈(E.Vωt).config.active,(E.Vωt).ctx.valueOfr=ht)
- (∀(h:Finn→Finm),E.P.massSet{ω∣E.actualHistω=h}=wE.ph)
- E.P.massSet{ω∣(n⋅ε)2≤(countk(E.actualHistω)−n⋅E.pk)2}≤E.pk⋅(1−E.pk)/(n⋅ε2)
assuming
hε 0<ε
hn 0<n
product_born_measure_unique
product_born_measure_unique · spine — we have
μS=((kronNλx↦ρ)⋅eventEffectES).trace.re
assuming
hρ ρ.PosSemidef
hE (Ek).PosSemidef
hμ0 μ∅=0
hμins a∈/S→μ(insertaS)=μ{a}+μS
hpt μ{ω}=∏tbornProbρE(ωt)
chebyshev_freq
chebyshev_freq · spine — we have
∑ωwpω≤pk⋅(1−pk)/(N⋅ε2)
assuming
hp 0≤pi
hp1 ∑ipi=1
hε 0<ε
hN 0<N
qiqth_born_typicality_conditional
qiqth_born_typicality_conditional · spine — we have
expectedIndicatoroutcomeM.μk=ck2
born_distribution_realizable_conditional
born_distribution_realizable_conditional · nogo — there is μ such that all of:
- (∀(γ:Γ),0≤μγ)
- ∑γμγ=1
- ∀(k:Outcome),outcomeMarginaloutcomeμk=ck2
assuming
h_surj Surjectiveoutcome
hc_norm ∑kck2=1
decoherence_does_not_concentrate
decoherence_does_not_concentrate · nogo — we have all of:
- 0<branchWeightc0
- 0<branchWeightc1
assuming
h0 c0=0
h1 c1=0
support_preservation_does_not_imply_measure_preservation
support_preservation_does_not_imply_measure_preservation · nogo — there is T, μ such that all of:
- BijectiveT
- SupportPreservingT
- ¬MeasurePreservingTμ
operational_data_insufficient
operational_data_insufficient · nogo — there is outcome, ν1, ν2 such that all of:
- (∀(k:Fin2),marginal3to2ν1outcomek=marginal3to2ν2outcomek)
- ν1=ν2