Theorem 4.28(c): trace-coefficient ratio
ProvedQAlgorithms.Papers.Independent.Intake100.P88.basic_construction_trace_coefficientsLet be algebraically closed and let be finite-dimensional split semisimple unital -algebras with compatible matrix units. Let be -bimodule linear, and let traces have expansions and , with . Fix a branching edge copy and its compatible coordinate inclusion . If and are the corresponding diagonal matrix units, define by extracting its matrix coefficient from . Then
Repeated branching copies are separate choices of . This formulation retains zero trace coefficients and requires no division by them.
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P88
noncomputable section
namespace QAlgorithms.Papers.Independent.Intake100.P88
attribute [local instance] Classical.propDecidable
open scoped BigOperators Matrix
open QAlgorithms.Papers.Independent.Information100.P65 (hookLength)
open QAlgorithms.Papers.Independent.Renew46.P30 (TensorIndex)
universe u v w x y
/-- Trace coefficient identity without division, PDF pp.36--38, Theorem 4.28(c).
The two edge-matrix equations are precisely compatibility of the chosen row and column
matrix units for one branching copy. Repeated edges remain separate choices of `j`.
The scalar is extracted from the actual bimodule map, not independently supplied. -/
theorem basic_construction_trace_coefficients (F A B I J : Type*)
[Field F] [IsAlgClosed F] [Ring A] [Algebra F A] [FiniteDimensional F A]
[Ring B] [Algebra F B] [FiniteDimensional F B]
[Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
(da : I → ℕ) (db : J → ℕ) (ha : ∀ i, 0 < da i) (_hb : ∀ j, 0 < db j)
(ea : A ≃ₐ[F] ((i : I) → Matrix (Fin (da i)) (Fin (da i)) F))
(eb : B ≃ₐ[F] ((j : J) → Matrix (Fin (db j)) (Fin (db j)) F))
(inc : A →ₐ[F] B) (_hinj : Function.Injective inc) (eps : B →ₗ[F] A)
(_hleft : ∀ a b, eps (inc a * b) = a * eps b)
(_hright : ∀ a b, eps (b * inc a) = eps b * a)
(ca : I → F) (cb : J → F)
(_htrace : ∀ b, splitTrace da ea ca (eps b) = splitTrace db eb cb b)
(mu : I) (lam : J) (j : Fin (da mu) ↪ Fin (db lam))
(_hcolumn : ∀ a, eb (inc a) lam * edgeMatrix (F := F) j = edgeMatrix j * ea a mu)
(_hrow : ∀ a, (edgeMatrix (F := F) j).transpose * eb (inc a) lam =
ea a mu * (edgeMatrix j).transpose) :
let p : Fin (da mu) := ⟨0, ha mu⟩
let scalar : F := ea (eps (splitMatrixUnit db eb lam (j p) (j p))) mu p p
(∀ q : Fin (da mu), eps (splitMatrixUnit db eb lam (j q) (j q)) =
scalar • splitMatrixUnit da ea mu q q) ∧ cb lam = scalar * ca mu := by sorry
end QAlgorithms.Papers.Independent.Intake100.P88
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be an algebraically closed field, let be finite-dimensional -algebras whose underlying structures are rings, and let be finite index types with decidable equality. Choose positive dimensions for every , and -algebra isomorphisms and . Let be an injective -algebra homomorphism and an -linear map satisfying and for all . Choose coefficients such that, for every , . Fix , , and an injection . Write when and otherwise, and assume that, for every , and , where the transpose involves no conjugation. Write and for the inverse images under the respective isomorphisms of the matrix with a single entry at in the indicated block and zero in every other entry and block. Set in the block and . Then every satisfies , and . Neither the coefficients nor are assumed nonzero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.