Lemma 3.5 —
ProvedGL2QFT.lemma_3_5Let be a subgroup of a finite group and a left transversal, so every is uniquely with , . Let be a family of representations of in bases . Let be a family of representations of in subgroup-adapted bases , i.e. satisfying (35). Then the Fourier transforms (22) of the two families satisfy
Here a basis vector of the right-hand codomain is identified with , and this identification is a bijection.
The lemma reduces the QFT of to the QFT of and the induction transform. The proof of Theorem 6.1 applies it to , eq. (146).
Formalization Note The identity is stated for arbitrary families of representations with adapted labels. The paper's families are complete sets of pairwise inequivalent irreducible unitary representations, in which case both sides are the Fourier transforms of Definition 2.6.
Differences from the source:
- generalization: complete families of pairwise inequivalent irreducible unitary representations of and , multiplicity-free restriction → any families of matrix representations (homomorphisms) with subgroup-adapted labels satisfying (35); reason: the proof uses only (35), multiplicativity of and , and the paper's families are instances
- encoding: the implicit identification of codomain basis vectors → an explicit map
ident, asserted to be a bijection, under which the rows are re-indexed; reason: the same identification made explicit
import Definitions.Def_GL2QFT_InductionTransform open Classical
namespace GL2QFT
open Induction
/-- arXiv:2608.28573 (held version, sha256 ecd45073…), **Lemma 3.5**, p.19 (PDF pp.20–21): "With
`H < G`, `T`, `B_λ` for all `λ ∈ Ĥ` and `B_μ` for all `μ ∈ Ĝ` as before, the Fourier transform `F_G`
of `G` from Definition 2.6 factors as `F_G = (U_Ind ⊗ I)(I_{ℂ[T]} ⊗ F_H) Enc` (43). Here, we have
`Enc` from Definition 3.2, `U_Ind` from Definition 3.3 and the subgroup Fourier transform `F_H`. In
this equation, we implicitly identify a basis vector `|λ, Q : λ̃ → μ, R*⟩` of the codomain of the
right hand side with the basis vector `|μ, Q : λ̃ → μ, (R : λ → μ)*⟩` of the codomain of the left
hand side."
For a finite group `G`, a subgroup `H`, a left transversal `T` (`g = th` uniquely), a family `R_λ`
of `H` in bases `B_λ`, and a family `R_μ` of representations of `G` in subgroup-adapted bases
`B_μ = {P : λ → μ | λ ∈ N⁻(μ), P ∈ B_λ}` satisfying (35): the identification `ident` is a bijection
and `F_G` (22) equals `(U_Ind ⊗ I)(I ⊗ F_H) Enc` with its rows re-indexed by `ident`. -/
theorem lemma_3_5 {G : Type} [Group G] [Fintype G] (H : Subgroup G) [Fintype H] (T : Set G)
[Fintype T] (hT : Subgroup.IsComplement T (H : Set G))
{ΛH ΛG : Type} [Fintype ΛH] [Fintype ΛG] (BH : ΛH → Type) [∀ l, Fintype (BH l)]
[∀ l, DecidableEq (BH l)] (Nminus : ΛG → Finset ΛH)
(RH : ∀ l, H → Matrix (BH l) (BH l) ℂ)
(RG : ∀ μ, G → Matrix (AdBas BH Nminus μ) (AdBas BH Nminus μ) ℂ)
(hRG : ∀ μ, IsMatRep (RG μ)) (hAd : IsSubgroupAdapted H BH Nminus RH RG) :
Function.Bijective (ident BH Nminus) ∧
fourierMatrix RG =
((UIndTensorI T BH Nminus RG * Matrix.kronecker (1 : Matrix T T ℂ) (fourierMatrix RH)) *
Enc H T).submatrix (ident BH Nminus) id := by sorry
end GL2QFT
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.