Theorem 3.7 — along a multiplicity-free chain, in the Gelfand–Tsetlin basis
ProvedGL2QFT.Supplement.theorem_3_7Let be a chain of subgroups of a finite group . At every level fix labels and representations of written in the bases indexed by the Bratteli paths , so that for the path basis of every is subgroup-adapted to ((35)), and fix left transversals of in . Define and, recursively,
Then
the Fourier transform (22) of , whose output basis is the Gelfand–Tsetlin basis indexed by pairs of paths .
The theorem turns the one-step factorization of Lemma 3.5 into a recursive QFT along any multiplicity-free chain (Figure 6); its cost is the sum of the costs of the encodings and induction transforms.
Formalization Note Levels are numbered , and is the subgroup grp k of with grp N = ⊤. The basis of a node at level is literally indexed by the pairs , , , so the output basis of is the path basis.
Differences from the source:
- generalization: Gelfand–Tsetlin bases of complete systems of irreps along a multiplicity-free chain → any matrix representations (homomorphisms) at every level in path-indexed bases subgroup-adapted to the previous level; reason: the proof applies Lemma 3.5 at each level, which uses only (35) and multiplicativity; the paper's Gelfand–Tsetlin bases (Corollary B.7) are an instance
- encoding: levels → with , the groups as subgroups of ; reason: indexing only
- encoding: the identification of Lemma 3.5 at each level, implicit in (44) → the rows of each re-indexed by the published
ident; reason: the same identification made explicit
import Definitions.Def_GL2QFT_Supplement_Chain open Classical
namespace GL2QFT
namespace Supplement
open Induction Chain
/-- arXiv:2608.28573 (held version, sha256 ecd45073…), **Theorem 3.7**, p.22 (PDF p.23): "Define
`Q_1 = F_{G_1} = I` and, recursively, define `Q_m = (U^m_Ind ⊗ I)(I_{ℂ[T_m]} ⊗ Q_{m−1}) Enc_m`,
`2 ≤ m ≤ n` (44). Then `Q_n = F_G`. Its output basis is the Gelfand–Tsetlin basis indexed by pairs
of paths in the Bratteli diagram."
Data (levels `k = 0, …, N`, the paper's `m = k + 1`, `n = N + 1`): a chain of subgroups
`{e} = grp 0 < grp 1 < ⋯ < grp N = G` of a finite group `G`; label sets `Λ k`; predecessor sets
`N⁻(μ) ⊆ Λ k` for `μ ∈ Λ (k+1)`; for each node a representation `R_μ` of `grp k` in the basis
indexed by the Bratteli paths `P(μ)` (the Gelfand–Tsetlin labels); left transversals `T_m` of
`grp k` in `grp (k+1)`. If every `R_μ` is a representation and the path basis of every node at level
`k + 1` is subgroup-adapted to `grp k` ((35)), then `Q_n` equals the Fourier transform (22) of `G`
in the Gelfand–Tsetlin basis, whose rows are the triples `(μ, Q, R)` with `Q, R ∈ P(μ)`.
**Formalization Note** `G_n = G` is the subgroup `grp N = ⊤`, so the columns of `Q_n` and of
`F_G` are the elements of `grp N`. As in the base mission's `lemma_3_5`, the families need not be
complete systems of irreps: the identity holds for any representations in subgroup-adapted path
bases, and the paper's Gelfand–Tsetlin bases of irreps are an instance. -/
theorem theorem_3_7 {G : Type} [Group G] [Fintype G] (N : ℕ) (grp : ℕ → Subgroup G)
(h0 : grp 0 = ⊥) (hN : grp N = ⊤) (hchain : ∀ k < N, grp k < grp (k + 1))
(Λ : ℕ → Type) [∀ k, Fintype (Λ k)] (Nm : ∀ k, Λ (k + 1) → Finset (Λ k))
(R : ∀ k (μ : Λ k), grp k → Matrix (Paths Λ Nm k μ) (Paths Λ Nm k μ) ℂ)
(hR : ∀ k ≤ N, ∀ μ, IsMatRep (R k μ))
(hAd : ∀ k < N, IsSubgroupAdapted (lowerSub grp k) (Paths Λ Nm k) (Nm k)
(fun l h => R k l (toLower grp k h)) (R (k + 1)))
(T : ∀ k, Set (grp (k + 1)))
(hT : ∀ k < N, Subgroup.IsComplement (T k) (lowerSub grp k : Set (grp (k + 1)))) :
chainQ grp Λ Nm R T N = fourierMatrix (R N) := by sorry
end Supplement
end GL2QFT