OAI/Analysis/FactorGeneration/PartialUnitaries.lean
40 declarations, 0 contain sorry, 0 declared as axioms
Popa's extension order on actual supported partial unitaries, and its exact L2 distance identity.
- structure
OAI.Generator.Tracial.PartialUnitaryline 19 - abbrev
OAI.Generator.Tracial.PartialUnitary.valline 24 - def
OAI.Generator.Tracial.PartialUnitary.Extendsline 26 - theorem
OAI.Generator.Tracial.PartialUnitary.support_le_of_extendsline 28 - theorem
OAI.Generator.Tracial.PartialUnitary.cross_initialline 37 - theorem
OAI.Generator.Tracial.PartialUnitary.cross_initial_revline 42 - theorem
OAI.Generator.Tracial.PartialUnitary.left_extendsline 47 - theorem
OAI.Generator.Tracial.PartialUnitary.extends_reflline 52 - theorem
OAI.Generator.Tracial.PartialUnitary.extends_transline 54 - theorem
OAI.Generator.Tracial.PartialUnitary.extline 61 - instance
OAI.Generator.Tracial.PartialUnitary.(instance at line 76)line 76 - theorem
OAI.Generator.Tracial.PartialUnitary.support_monoline 87 - theorem
OAI.Generator.Tracial.PartialUnitary.difference_squareline 90 - theorem
OAI.Generator.Tracial.PartialUnitary.distance_sqline 95 - theorem
OAI.Generator.Tracial.PartialUnitary.support_trace_monoline 101 - theorem
OAI.Generator.Tracial.PartialUnitary.support_trace_le_oneline 120 - theorem
OAI.Generator.Tracial.PartialUnitary.monotone_cauchyline 125 - theorem
OAI.Generator.Tracial.PartialUnitary.of_L2_limitline 145Source documentation
Closedness of actual partial unitaries in the operator norm unit ball for L2 convergence.
theorem of_L2_limit (a : ℕ → PartialUnitary M) (b : M.toStarSubalgebra) (hb : Tendsto (fun n => τ.norm₂ ((a n).val-b)) atTop (𝓝 0)) : ∃ v : PartialUnitary M, v.val=b := by …Mentions: OAI.Generator.Tracial.PartialUnitary, OAI.Generator.Tracial.PartialUnitary.val
- theorem
OAI.Generator.Tracial.PartialUnitary.le_of_eventually_le_limitline 172Source documentation
A bounded L2 limit retains every eventually fixed extension.
theorem le_of_eventually_le_limit (a : ℕ → PartialUnitary M) (v w : PartialUnitary M) (hv : Tendsto (fun n => τ.norm₂ ((a n).val-v.val)) atTop (𝓝 0)) (hw : ∀ᶠ n in atTop, w ≤ a n) : w ≤ v := by …Mentions: OAI.Generator.Tracial.PartialUnitary, OAI.Generator.Tracial.PartialUnitary.val
- theorem
OAI.Generator.Tracial.PartialUnitary.monotone_limitline 184 - theorem
OAI.Generator.Tracial.PartialUnitary.eq_of_le_of_trace_eqline 203 - theorem
OAI.Generator.Tracial.PartialUnitary.support_limitline 210 - theorem
OAI.Generator.Tracial.PartialUnitary.support_trace_limitline 218 - theorem
OAI.Generator.Tracial.PartialUnitary.limit_le_of_leline 223 - theorem
OAI.Generator.Tracial.PartialUnitary.chain_limitline 236Source documentation
A nonempty chain has a sequential L2 upper bound; no countability of the chain and no cyclicity of the trace vector are assumed.
theorem chain_limit (c : Set (PartialUnitary M)) (hc : IsChain (· ≤ ·) c) (hne : c.Nonempty) : ∃ (a : ℕ → PartialUnitary M) (v : PartialUnitary M), (∀ n, a n ∈ c) ∧ Monotone a ∧ (∀ w ∈ c, w ≤ v) ∧ Tendsto (fun n => τ.norm₂ ((a n).val-v.val)) atTop (𝓝 0) := by …Mentions: OAI.Generator.Tracial.PartialUnitary, OAI.Generator.Tracial.PartialUnitary.val
- def
OAI.Generator.Tracial.dyadicSignline 291 - def
OAI.Generator.Tracial.dyadicRademacherline 293 - theorem
OAI.Generator.Tracial.dyadicRademacher_starline 296 - theorem
OAI.Generator.Tracial.dyadicRademacher_sqline 304 - def
OAI.Generator.Tracial.dyadicCornerUnitaryline 314 - theorem
OAI.Generator.Tracial.dyadicRademacher_centered_over_previousline 321Source documentation
The next sign is centered even after multiplication by an arbitrary member of the previous finite dyadic algebra.
theorem dyadicRademacher_centered_over_previous (p : AlgebraProjection M) (n : ℕ) (c : DyadicIndex n → ℂ) : τ.trace (dyadicEval τ hdiff p n c*dyadicRademacher τ hdiff p n)=0 := by …Mentions: OAI.Generator.Tracial.AlgebraProjection, OAI.Generator.Tracial.DyadicIndex, OAI.Generator.Tracial.dyadicEval, OAI.Generator.Tracial.dyadicRademacher
- theorem
OAI.Generator.Tracial.dyadicRademacher_trace_mul_of_ltline 336 - theorem
OAI.Generator.Tracial.dyadicRademacher_trace_mul_of_neline 343 - theorem
OAI.Generator.Tracial.coordinate_inner_eq_traceline 350 - theorem
OAI.Generator.Tracial.dyadicRademacher_norm₂line 355 - theorem
OAI.Generator.Tracial.orthonormal_inner_tendsto_zeroline 377Source documentation
Bessel's inequality makes the coefficients of an orthonormal sequence vanish.
theorem orthonormal_inner_tendsto_zero (v : ℕ → H) (hv : Orthonormal ℂ v) (x : H) : Tendsto (fun n => inner ℂ x (v n)) atTop (𝓝 0) := by … - theorem
OAI.Generator.Tracial.dyadicRademacher_weak_trace_zeroline 398 - theorem
OAI.Generator.Tracial.dyadicRademacher_mixed_trace_zeroline 424 - theorem
OAI.Generator.Tracial.inclusion_corner_mixed_trace_zeroline 435Source documentation
The same sequence has vanishing ambient mixed traces, even when the coefficients belong to M and the partial unitaries belong to P.
theorem inclusion_corner_mixed_trace_zero {P : VonNeumannAlgebra H} (hPM : P ≤ M) (hdiffP : ∀ p : P.toStarSubalgebra, IsStarProjection p → p ≠ 0 → ∃ q : P.toStarSubalgebra, IsStarProjection q ∧ q ≠ 0 ∧ q ≠ p ∧ p*q = q ∧ q*p = q) (p : AlgebraProjection P) (hp : p.val ≠ 0) (x y : M.toStarSubalgebra) : Tendsto (fun n => τ.trace (x*coordinateInclusion hPM (dyadicCornerUnitary (restrictedTrace τ hPM) hdiffP p n).val*y)) atTop (𝓝 0) := by …Mentions: OAI.Generator.Tracial.AlgebraProjection, OAI.Generator.Tracial.coordinateInclusion, OAI.Generator.Tracial.dyadicCornerUnitary, OAI.Generator.Tracial.restrictedTrace
- theorem
OAI.Generator.Tracial.exists_cornerUnitary_small_mixed_tracesline 451Source documentation
Actual simultaneous scalar nonintertwining choices in every nonzero corner, with arbitrary finite sets of ambient left and right coefficients.
theorem exists_cornerUnitary_small_mixed_traces {P : VonNeumannAlgebra H} (hPM : P ≤ M) (hdiffP : ∀ p : P.toStarSubalgebra, IsStarProjection p → p ≠ 0 → ∃ q : P.toStarSubalgebra, IsStarProjection q ∧ q ≠ 0 ∧ q ≠ p ∧ p*q = q ∧ q*p = q) (p : AlgebraProjection P) (hp : p.val ≠ 0) (F G : Finset M.toStarSubalgebra) (ε : ℝ) (hε : 0 < ε) : ∃ v : CornerUnitary p, ∀ x ∈ F, ∀ y ∈ G, ‖τ.trace (x*coordinateInclusion hPM v.val*y)‖ < ε := by …Mentions: OAI.Generator.Tracial.AlgebraProjection, OAI.Generator.Tracial.CornerUnitary, OAI.Generator.Tracial.coordinateInclusion