OAI/Analysis/Cuntz/Monoid.lean
19 declarations, 0 contain sorry, 0 declared as axioms
The ordered Cuntz monoid and compression by its order unit.
- abbrev
OAI.Kaplansky.CuntzMonoidline 18Source documentation
The ordered Cuntz monoid of actual positive finite matrices over A. The order is rectangular norm comparison, not an assumed abstract relation.
abbrev CuntzMonoid (A : Type*) [CStarAlgebra A] := …
- def
OAI.Kaplansky.cuntzClassline 21 - theorem
OAI.Kaplansky.cuntzClass_leline 24 - theorem
OAI.Kaplansky.cuntzClass_eqline 28 - instance
OAI.Kaplansky.(instance at line 33)line 33 - instance
OAI.Kaplansky.(instance at line 34)line 34 - theorem
OAI.Kaplansky.cuntzClass_addline 38 - instance
OAI.Kaplansky.(instance at line 41)line 41 - instance
OAI.Kaplansky.(instance at line 70)line 70 - theorem
OAI.Kaplansky.cuntzMonoid_nonnegline 78 - def
OAI.Kaplansky.cuntzUnitline 83Source documentation
Class of the n-by-n identity.
def cuntzUnit (A : Type*) [CStarAlgebra A] (n : ℕ) : CuntzMonoid A := …
Mentions: OAI.Kaplansky.CuntzMonoid
- theorem
OAI.Kaplansky.cuntzUnit_zeroline 86 - theorem
OAI.Kaplansky.cuntzUnit_addline 95 - theorem
OAI.Kaplansky.cuntzUnit_nsmulline 105 - theorem
OAI.Kaplansky.cuntzMonoid_orderUnitline 111Source documentation
Every class is bounded by a natural multiple of [1_A].
theorem cuntzMonoid_orderUnit (x : CuntzMonoid A) : ∃ n : ℕ, x ≤ n • cuntzUnit A 1 := by …
Mentions: OAI.Kaplansky.CuntzMonoid, OAI.Kaplansky.cuntzUnit
- theorem
OAI.Kaplansky.properlyInfinite_of_coisometry_halfline 131Source documentation
A coisometry supported on the first half of the columns gives two orthogonal isometries in the undoubled algebra.
theorem properlyInfinite_of_coisometry_half (Y : CStarMatrix (ι ⊕ ι) (ι ⊕ ι) A) (hY : Y * star Y = 1) (hzero : ∀ i j, Y i (Sum.inr j) = 0) : ProperlyInfinite (CStarMatrix ι ι A) := by …Mentions: OAI.Kaplansky.ProperlyInfinite
- theorem
OAI.Kaplansky.properlyInfinite_of_invertible_rectangular_gramline 157Source documentation
Invertible rectangular row Gram gives a genuine coisometry by inverse square-root normalization. The zero column block is retained.
theorem properlyInfinite_of_invertible_rectangular_gram (v : Matrix (ι ⊕ ι) ι A) (hv : IsUnit (CStarMatrix.ofMatrix (v * v.conjTranspose))) : ProperlyInfinite (CStarMatrix ι ι A) := by …Mentions: OAI.Kaplansky.ProperlyInfinite
- theorem
OAI.Kaplansky.properlyInfinite_of_cuntzLE_double_unitline 190Source documentation
Approximate compression of a doubled identity already forces proper infiniteness, using the radius-one invertibility criterion.
theorem properlyInfinite_of_cuntzLE_double_unit (h : CuntzLE (1 : Matrix (ι ⊕ ι) (ι ⊕ ι) A) (1 : Matrix ι ι A)) : ProperlyInfinite (CStarMatrix ι ι A) := by …Mentions: OAI.Kaplansky.CuntzLE, OAI.Kaplansky.ProperlyInfinite
- theorem
OAI.Kaplansky.properlyInfinite_of_cuntzUnit_compressionline 201