OAI/RepresentationTheory/Tensor/Postselection.lean
87 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.CoordinateSweeps.OrdinaryTensor.countline 17Source comment
Occupancies of single alphabet symbols in an ordinary tensor word.def count (w : I → A) (a : A) : ℕ := Fintype.card {i : I // w i = a}Mentions: OAI.CoordinateSweeps.a
- def
OAI.CoordinateSweeps.OrdinaryTensor.permuteline 20Source comment
Ordinary tensor permutation, with the manuscript's product convention.def permute (σ : Equiv.Perm I) : Equiv.Perm (I → A) where …
- lemma
OAI.CoordinateSweeps.OrdinaryTensor.permute_mulline 27 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.count_leline 32 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.sum_countline 35 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.counts_eq_exists_permline 40 - def
OAI.CoordinateSweeps.OrdinaryTensor.fiberPermEquivline 53Source comment
Word-preserving permutations and independent permutations of its fibers are literally equivalent finite sets. This yields the factorial frame moments.def fiberPermEquiv (w : I → A) : {σ : Equiv.Perm I // ∀ i, w (σ i) = w i} ≃ (∀ a : A, Equiv.Perm {i : I // w i = a}) where …Mentions: OAI.CoordinateSweeps.a
- lemma
OAI.CoordinateSweeps.OrdinaryTensor.card_wordStabilizerline 69 - def
OAI.CoordinateSweeps.OrdinaryTensor.transporterEquivline 76Source comment
A transporter fiber is a coset of the literal word stabilizer.def transporterEquiv (u w : I → A) (σ : Equiv.Perm I) (hσ : permute σ u = w) : {g : Equiv.Perm I // permute g u = w} ≃ {g : Equiv.Perm I // ∀ i, u (g i) = u i} where … - lemma
OAI.CoordinateSweeps.OrdinaryTensor.permute_countline 95 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.card_transporterline 104 - def
OAI.CoordinateSweeps.OrdinaryTensor.momentFrameline 116Source comment
The finite moment matrix which will be realized by actual radial Gamma variables and root phases rather than an assumed de Finetti density.def momentFrame : Matrix (I → A) (I → A) ℂ := fun u w => …
- lemma
OAI.CoordinateSweeps.OrdinaryTensor.momentFrame_eq_perm_sumline 119 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.factorial_step_upperline 135Source comment
A factorial ratio is bounded by the largest factor; used to avoid any assumed entropy/Stirling estimate in the empirical postselection measure.lemma factorial_step_upper (t k : ℕ) : (t+k).factorial ≤ t.factorial * (t+k)^k := by …
- lemma
OAI.CoordinateSweeps.OrdinaryTensor.factorial_modeline 148Source comment
For any integral Poisson mean n, n is a mode. This elementary exact inequality is the only numerical ingredient for the finite tensor mixture.lemma factorial_mode (n t : ℕ) : n^t * n.factorial ≤ n^n * t.factorial := by …
- lemma
OAI.CoordinateSweeps.OrdinaryTensor.prod_word_eq_countsline 164 - def
OAI.CoordinateSweeps.OrdinaryTensor.orbitFiberEquivline 170Source comment
Exact sigma decomposition of a word orbit and its transporter fibers.def orbitFiberEquiv (u : I → A) : (Σ w : {w : I → A // count w = count u}, {σ : Equiv.Perm I // permute σ u = w.val}) ≃ Equiv.Perm I where …Mentions: OAI.CoordinateSweeps.OrdinaryTensor.count, OAI.CoordinateSweeps.OrdinaryTensor.permute
- lemma
OAI.CoordinateSweeps.OrdinaryTensor.orbit_card_mul_factorialsline 182 - abbrev
OAI.CoordinateSweeps.OrdinaryTensor.Histogramline 198Source comment
Histogram space is an actual finite set of attained occupancies.abbrev Histogram (I A : Type*) [Fintype I] [Fintype A] [DecidableEq A] := …
- instance
OAI.CoordinateSweeps.OrdinaryTensor.(instance at line 201)line 201 - instance
OAI.CoordinateSweeps.OrdinaryTensor.(instance at line 202)line 202 - def
OAI.CoordinateSweeps.OrdinaryTensor.histogramline 204 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.histogram_surjectiveline 207 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.histogram_card_leline 212 - def
OAI.CoordinateSweeps.OrdinaryTensor.typeWeightline 223Source comment
The individual multinomial type of a word, evaluated at any integer weights.def typeWeight (r : A → ℕ) (u : I → A) : ℕ := …
- lemma
OAI.CoordinateSweeps.OrdinaryTensor.typeWeight_mul_factorialsline 226 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.typeWeight_empirical_maxline 232Source comment
Empirical occupancies maximize their own exact multinomial type weight.lemma typeWeight_empirical_max (u w : I → A) : typeWeight (count u) w ≤ typeWeight (count u) u := by …
Mentions: OAI.CoordinateSweeps.OrdinaryTensor.typeWeight, OAI.CoordinateSweeps.OrdinaryTensor.count
- def
OAI.CoordinateSweeps.OrdinaryTensor.histogramWeightline 251Source comment
Type weight on the finite, attained histogram space.def histogramWeight (r : A → ℕ) (h : Histogram I A) : ℕ := …
- lemma
OAI.CoordinateSweeps.OrdinaryTensor.histogramWeight_mkline 254 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.sum_histogramWeightline 264 - theorem
OAI.CoordinateSweeps.OrdinaryTensor.empirical_type_massline 281Source comment
Exact polynomial empirical multinomial lower bound. It includes zero occupancies and avoids Stirling errors and asymptotic hypotheses.theorem empirical_type_mass (u : I → A) : (Fintype.card I)^Fintype.card I ≤ (Fintype.card I+1)^Fintype.card A * typeWeight (count u) u := by …Mentions: OAI.CoordinateSweeps.OrdinaryTensor.typeWeight, OAI.CoordinateSweeps.OrdinaryTensor.count
- abbrev
OAI.CoordinateSweeps.OrdinaryTensor.PhaseSpaceline 305Source comment
Finite independent root phases. The modulus is strictly larger than any occupancy, so it distinguishes every histogram without an analytic limit.abbrev PhaseSpace (I A : Type*) [Fintype I] := A → ZMod (Fintype.card I+1)
- def
OAI.CoordinateSweeps.OrdinaryTensor.wordPhaseline 307 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.wordPhase_eq_prodline 311 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.phase_conjugate_sumline 321 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.wordPhase_orthogonalityline 347 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.wordPhase_star_mulline 354 - def
OAI.CoordinateSweeps.OrdinaryTensor.tensorVectorline 368 - def
OAI.CoordinateSweeps.OrdinaryTensor.outerline 369 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.outer_posSemidefline 371 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.outer_applyline 374 - def
OAI.CoordinateSweeps.OrdinaryTensor.empiricalVectorline 378Source comment
Empirical-site amplitudes. Their exact squared norm is one when there is at least one slot. Zero-count letters are allowed and have zero amplitude.def empiricalVector (h : Histogram I A) (t : PhaseSpace I A) (a : A) : ℂ := …
Mentions: OAI.CoordinateSweeps.OrdinaryTensor.Histogram, OAI.CoordinateSweeps.OrdinaryTensor.PhaseSpace, OAI.CoordinateSweeps.a
- def
OAI.CoordinateSweeps.OrdinaryTensor.amplitudeline 381 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.char_star_mulline 385 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.empiricalVector_squareline 391 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.empiricalVector_unitline 404 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.amplitude_eq_countsline 413 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.amplitude_congrline 420 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.tensorVector_empiricalline 424 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.amplitude_squareline 430 - def
OAI.CoordinateSweeps.OrdinaryTensor.phaseFrameline 439Source comment
Finite phase average of actual pure product states.def phaseFrame (h : Histogram I A) : Matrix (I → A) (I → A) ℂ := …
- lemma
OAI.CoordinateSweeps.OrdinaryTensor.phaseSpace_card_posline 444 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.phaseFrame_posSemidefline 449 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.phaseFrame_entryline 455 - def
OAI.CoordinateSweeps.OrdinaryTensor.orbitSizeline 477 - def
OAI.CoordinateSweeps.OrdinaryTensor.representativeline 478 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.count_representativeline 481 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.histogram_representativeline 484 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.orbitSize_posline 487 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.orbitSize_mkline 491 - def
OAI.CoordinateSweeps.OrdinaryTensor.blockline 496 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.block_posSemidefline 500 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.block_entryline 503 - def
OAI.CoordinateSweeps.OrdinaryTensor.symProjectorline 510Source comment
Orthogonal projection onto vectors invariant under ordinary slot permutations, implemented by their exact histogram blocks.def symProjector : Matrix (I → A) (I → A) ℂ := …
- lemma
OAI.CoordinateSweeps.OrdinaryTensor.symProjector_posSemidefline 513 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.symProjector_entryline 518 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.symProjector_mulVec_of_constantline 528 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.symProjector_idempotentline 549 - def
OAI.CoordinateSweeps.OrdinaryTensor.histogramAmplitudeline 556 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.histogramAmplitude_mkline 559 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.phaseFrame_blocksline 565 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.inverse_orbit_le_empiricalline 582Source comment
Polynomial inverse-orbit bound for the **actual** empirical phase frame.lemma inverse_orbit_le_empirical (hn : 0 < Fintype.card I) (h : Histogram I A) : (orbitSize h : ℝ)⁻¹ ≤ ((Fintype.card I+1)^Fintype.card A : ℕ) * histogramAmplitude h h ^ 2 := by …Mentions: OAI.CoordinateSweeps.OrdinaryTensor.Histogram, OAI.CoordinateSweeps.OrdinaryTensor.orbitSize, OAI.CoordinateSweeps.OrdinaryTensor.histogramAmplitude
- lemma
OAI.CoordinateSweeps.OrdinaryTensor.phaseFrame_sum_blocksline 606 - theorem
OAI.CoordinateSweeps.OrdinaryTensor.phaseFrame_sum_dominationline 616Source comment
Constructive finite postselection before normalizing the histogram sum.theorem phaseFrame_sum_domination (hn : 0 < Fintype.card I) : ((((Fintype.card I+1)^Fintype.card A : ℕ) : ℂ) • (∑ h : Histogram I A, phaseFrame h) - symProjector).PosSemidef := by …Mentions: OAI.CoordinateSweeps.OrdinaryTensor.Histogram, OAI.CoordinateSweeps.OrdinaryTensor.phaseFrame, OAI.CoordinateSweeps.OrdinaryTensor.symProjector
- instance
OAI.CoordinateSweeps.OrdinaryTensor.(instance at line 643)line 643 - def
OAI.CoordinateSweeps.OrdinaryTensor.finiteMixtureline 647Source comment
Literal finite average of empirical pure product tensors, grouped first by histogram and then by independent roots.def finiteMixture : Matrix (I → A) (I → A) ℂ := …
- lemma
OAI.CoordinateSweeps.OrdinaryTensor.finiteMixture_posSemidefline 651 - theorem
OAI.CoordinateSweeps.OrdinaryTensor.finite_postselectionline 658Source comment
Finite, normalized tensor postselection with explicit polynomial overhead. Every product in finiteMixture comes from squared-norm-one empirical vectors; there is no de Finetti theorem or independent density assumption.theorem finite_postselection [Nonempty A] (hn : 0 < Fintype.card I) : ((((Fintype.card I+1)^(2*Fintype.card A) : ℕ) : ℂ) • (finiteMixture (I := I) (A := A)) - symProjector).PosSemidef := by …Mentions: OAI.CoordinateSweeps.OrdinaryTensor.finiteMixture, OAI.CoordinateSweeps.OrdinaryTensor.symProjector
- lemma
OAI.CoordinateSweeps.OrdinaryTensor.outer_tensorVector_traceline 684 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.phaseFrame_traceline 694 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.finiteMixture_traceline 701 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.outer_trace_nonnegline 718 - theorem
OAI.CoordinateSweeps.OrdinaryTensor.invariant_vector_postselectionline 723Source comment
The ordinary finite postselection theorem applied to an actual invariant purification vector, rather than an assumed projection inequality.theorem invariant_vector_postselection [Nonempty A] (hn : 0 < Fintype.card I) (v : (I → A) → ℂ) (hv : ∀ σ : Equiv.Perm I, ∀ w, v (permute σ w) = v w) : ((Matrix.trace (outer v) * ((Fintype.card I+1 : ℕ) : ℂ)^(2*Fintype.card A)) • finiteMixture - outer v).PosSemidef := by …Mentions: OAI.CoordinateSweeps.OrdinaryTensor.permute, OAI.CoordinateSweeps.OrdinaryTensor.outer, OAI.CoordinateSweeps.OrdinaryTensor.finiteMixture
- def
OAI.CoordinateSweeps.OrdinaryTensor.rawMixtureline 748 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.rawMixture_posSemidefline 751 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.rawMixture_eqline 754 - lemma
OAI.CoordinateSweeps.OrdinaryTensor.rawMixture_dominationline 767