import OAI.Analysis.InterpolatedFactors.Positive
namespace OAI
noncomputable section
universe u_1 u_2
namespace FreeGroupFactorMain.Amplification
section
open scoped ENNReal
variable {G : Type u_1} [Group G]
theorem cornerStabilization_weight_iff (a : ℝ) (ha : 0 ENNReal.ofReal a*z) h
simpa only [←mul_assoc,ENNReal.mul_inv_cancel ha0 hat,one_mul] using hh
· intro h
rw [h,←mul_assoc,ENNReal.inv_mul_cancel ha0 hat,one_mul]
theorem doubleDiagonal_matrix (T : stabilization G) (i j : ℕ) :
matrixEntry (doubleDiagonal T : GroupOperator (ℕ × (ℕ × G))) i j=
if i=j then (T : GroupOperator (ℕ × G)) else 0 := by
change matrixEntry (productAmplification ℕ (ℕ × G) T) i j=_
ext ξ x
rw [matrixEntry_apply,productAmplification_productSingle,productSingle_apply]
by_cases h : i=j <;> simp [h]
theorem doubleFiniteDiagonal_supported (n : ℕ) (p : stabilization G) (hp : IsStarProjection p)
(q : Corner p hp) :
doubleDiagonal p * doubleFiniteDiagonal n q.val=doubleFiniteDiagonal n q.val ∧
doubleFiniteDiagonal n q.val * doubleDiagonal p=doubleFiniteDiagonal n q.val := by
constructor
· apply Subtype.ext
apply matrixEntry_ext
intro i j
change matrixEntry (productAmplification ℕ (ℕ × G) (p : GroupOperator (ℕ × G))*finiteDiagonal n (q.val : GroupOperator (ℕ × G))) i j=matrixEntry (finiteDiagonal n (q.val : GroupOperator (ℕ × G))) i j
rw [matrixEntry_diagonal_mul,finiteDiagonal_sum]
simp only [matrixEntry_sum,matrixEntry_matrixBlock,Finset.mul_sum]
apply Finset.sum_congr rfl
intro k _
split_ifs
· exact congrArg Subtype.val q.property.1
· exact mul_zero _
· apply Subtype.ext
apply matrixEntry_ext
intro i j
change matrixEntry (finiteDiagonal n (q.val : GroupOperator (ℕ × G))*productAmplification ℕ (ℕ × G) (p : GroupOperator (ℕ × G))) i j=matrixEntry (finiteDiagonal n (q.val : GroupOperator (ℕ × G))) i j
rw [matrixEntry_mul_diagonal,finiteDiagonal_sum]
simp only [matrixEntry_sum,matrixEntry_matrixBlock,Finset.sum_mul]
apply Finset.sum_congr rfl
intro k _
split_ifs
· exact congrArg Subtype.val q.property.2
· exact zero_mul _
theorem finiteFlatten_supported (n : ℕ) (p : stabilization G) (hp : IsStarProjection p)
(q : Corner p hp) : repeatFlatten p * finiteFlatten n q.val=finiteFlatten n q.val ∧
finiteFlatten n q.val * repeatFlatten p=finiteFlatten n q.val := by
obtain ⟨hl,hr⟩ := doubleFiniteDiagonal_supported n p hp q
constructor
· have h := congrArg (flattenStabilizationIso (G := G)) hl
simpa only [map_mul,repeatFlatten,finiteFlatten] using h
· have h := congrArg (flattenStabilizationIso (G := G)) hr
simpa only [map_mul,repeatFlatten,finiteFlatten] using h
def cornerFiniteProjection (n : ℕ) (p : stabilization G) (hp : IsStarProjection p)
(q : Corner p hp) : CornerStabilization p hp :=
⟨finiteFlatten n q.val,finiteFlatten_supported n p hp q⟩
theorem cornerFiniteProjection_projection (n : ℕ) (p : stabilization G) (hp : IsStarProjection p)
(q : Corner p hp) (hq : IsStarProjection q) : IsStarProjection (cornerFiniteProjection n p hp q) := by
have hh := finiteFlatten_projection n q.val (nested_projection p hp q hq)
constructor
· exact Subtype.ext hh.isIdempotentElem.eq
· exact Subtype.ext hh.isSelfAdjoint.star_eq
end
open scoped ENNReal
variable {G : Type u_2} [Group G]
theorem projection_weight_of_trace (p : stabilization G) (hp : IsStarProjection p)
(hfin : stabilizedProjectionTrace p≠⊤) (a : ℝ) (hτ : stabilizedTrace p=(a:ℂ)) :
stabilizedProjectionTrace p=ENNReal.ofReal a := by
have h := stabilizedTrace_star_mul p hfin
rw [hp.isSelfAdjoint.star_eq,hp.isIdempotentElem.eq,hτ] at h
have he : (stabilizedProjectionTrace p).toReal=a := Complex.ofReal_injective h.symm
rw [←he,ENNReal.ofReal_toReal hfin]
theorem corner_projection_weight (a : ℝ) (ha : 0 (a:ℂ)*z) hqτ
change (a:ℂ)*((a:ℂ)⁻¹*stabilizedTrace q.val)=(a:ℂ)*(s:ℂ) at h
rw [←mul_assoc,mul_inv_cancel₀ ha0,one_mul] at h
simpa only [Complex.ofReal_mul] using h
theorem cornerStabilization_projection_exists
(hpos : ∀(t : ℝ),0