Theorem 7.20 — Steps 3–8 of Algorithm 2 implement the right-coset induction transform (212)
ProvedGL2QFT.Supplement.theorem_7_20inductionlittle-group-methodp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-fourier-transform
Let be finite groups, under the extension hypothesis (194) of Theorem 7.12. Fix the data of §7: representatives of , orbit representatives , for a transversal with (Definition 7.2) and orbit transport intertwiners with (Definition 7.4), representatives of the irreps of the little groups , and a transversal of (). Then for every , encoded as with , Steps 3–8 of Algorithm 2 with omitted, acting on the right -Fourier register and the coset register,
equal the right-coset induction transform of Definition B.3,
in the -adapted basis (199) and the little group basis (198).
Differences from the source:
- encoding: "Steps 3–8 implement the right-coset induction transform on the right -Fourier register" → for each , the product of the matrices of Steps 3–8 (without ) on equals (212); reason: the left -Fourier register is untouched by these steps
- encoding: the classical Step 5, with → the output occurs exactly when , with ; reason: Definition 7.18's unique factorization
- encoding: Step 3 () and Step 7 (, uncompute , relabel ) → taken as parameters with (
IsOrbEnc), and the coset used directly as the input of ; reason: classical relabellings whose outputs are determined by Definition 7.16 and Lemma 7.19
Preamble
import Definitions.Def_GL2QFT_Supplement_LittleGroup open Classical
Formal statement
namespace GL2QFT
namespace Supplement
open LittleGroup
/-- arXiv:2608.28573 (held version, sha256 ecd45073…), **Theorem 7.20**, p.64 (PDF p.65): "Under the
extension hypothesis of Theorem 7.12, Steps 3–8 of Algorithm 2, omitting `U^L_orb` in Step 4,
implement the right-coset induction transform in Definition B.3, on the right `N`-Fourier register."
Setting of §7 (pp.55–63): `N ⊴ G` finite; chosen representatives `R_λ` of `N̂`; a set `O` of orbit
representatives; for `σ ∈ O` a set `T_σ` of representatives of `g₁ ∼ g₂ ⟺ (g₁)σ = (g₂)σ` with
`g_{σ,σ} = 1`; orbit transport intertwiners `U_{t,σ}` normalized by `U_{1,σ} = id`; fixed extensions
`R^ext_λ` of every `R_λ` to `I_λ` (194); representatives `R_{η′}` of the duals of the little groups
`H_σ = I_σ / N`; a transversal `T_N` of `N` (`g = nh`). Then for every `λ`, encoded as `(σ, t_L)`
(`λ = (t_L)σ`), Steps 3–8 without `U^L_orb`, as an operator from `V*_λ ⊗ ℂ[T_N]` to
`⊕_{η′} ℂ^{d_{η′}} ⊗ V*_(σ,η′)`, equal the right-coset induction transform (212) in the `N`-adapted
basis (199) and the little group basis (198). -/
theorem theorem_7_20 {G : Type} [Group G] [Fintype G] (N : Subgroup G) [N.Normal]
{ΛN : Type} [Fintype ΛN] (BN : ΛN → Type) [∀ l, Fintype (BN l)] [∀ l, DecidableEq (BN l)]
(RN : ∀ l, N → Matrix (BN l) (BN l) ℂ) (hRN : IsIrrepSystem RN)
(O : Set ΛN) (hO : IsOrbitTransversal N RN O)
(Tσ : ΛN → Set G) (hTσ : ∀ σ ∈ O, IsLabelTransversal N BN RN Tσ σ)
(U : ∀ σ : ΛN, G → ∀ l : ΛN, Matrix (BN l) (BN σ) ℂ)
(hU : IsOrbitTransport N BN RN O Tσ U)
(Rext : ∀ l, inertia N RN l → Matrix (BN l) (BN l) ℂ)
(hext : ∀ l, IsExtension N RN l (Rext l))
{Λη : ΛN → Type} [∀ σ, Fintype (Λη σ)] (Bη : ∀ σ, Λη σ → Type) [∀ σ η, Fintype (Bη σ η)]
[∀ σ η, DecidableEq (Bη σ η)]
(Rη : ∀ σ η, (inertia N RN σ ⧸ N.subgroupOf (inertia N RN σ)) →
Matrix (Bη σ η) (Bη σ η) ℂ)
(hRη : ∀ σ ∈ O, IsIrrepSystem (Rη σ))
(TN : Set G) (hTN : Subgroup.IsComplement (N : Set G) TN)
(l σ : ΛN) (tL : Tσ σ) (henc : IsOrbEnc N BN RN O Tσ l σ (tL : G)) :
stepsRight N BN RN Tσ U Rext Bη Rη TN l σ tL =
uIndRight N BN RN Tσ U Rext Bη Rη TN l σ tL := by sorry
end Supplement
end GL2QFT
Source
Bruinsma, Posta, Stokvis, Grinko, Ozols, Quantum Fourier transform toolbox, arXiv:2608.28573 (held version, sha256 ecd45073…), Theorem 7.20, eq. (212), p.64 (PDF p.65); Algorithm 2 p.63; Definitions 7.14–7.18 pp.61–62; Definition B.3 p.82