Unnumbered (2.3): orbit basis
ProvedQAlgorithms.Papers.Independent.Intake100.P88.orbit_basisLet be a half-integer, and let be the complex vector space freely spanned by its partition diagrams. Order diagrams by refinement, so means that every block of is contained in a block of . There is a unique basis satisfying
This is the orbit basis used by the exact-equality tensor matrices. The summation uses coarsenings, correcting the reversed inequality printed in (2.3); the correction is forced by (3.8).
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
/-- Unique orbit basis, PDF pp.9--10, (2.3).
SOURCE CORRECTION: sum over coarsenings, as forced by exact-equality matrices (3.8),
rather than the printed reversed refinement inequality. -/
theorem orbit_basis (m : ℕ) :
∃! b : Module.Basis (LevelDiagram m) ℂ (DiagramSpace m),
∀ d : LevelDiagram m,
Finsupp.single d 1 = ∑ e ∈ Finset.univ.filter (fun e : LevelDiagram m => d.val ≤ e.val), b e := by sorry
end QAlgorithms.Papers.Independent.Intake100.P88
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , let consist of equivalence relations on two Boolean rows of vertices each, requiring the two last-index vertices to be related if is odd, and let be the complex vector space of finitely supported functions . There exists exactly one complex vector-space basis indexed by such that, for every , , where is the function equal to at and elsewhere, and means that every pair related by is also related by . The assertion includes : the diagram set is then a singleton, and the required basis vector is its delta function.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.