Theorem C.2 (Mackey induction with multiplicities) — , every unitary
ProvedGL2QFT.Supplement.theorem_C_2mackey-theoryp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-fourier-transformrepresentation-theory
Let be a finite group, and . Keep , , and of Remark 5.2, but drop multiplicity-freeness and -adaptedness: fix representatives of the irreps of , and every , the bases of the -irreps subgroup-adapted to with multiplicities (Definition B.1), and any choice of the embeddings and of (290). Then
- the circuit of Figure 20 implements of (291) in the bases of §C.1:
with its first three steps and ; 2. every block of (294) is unitary.
The theorem removes every structural assumption of Remark 5.2 except the double-coset data; Theorem 5.4 is its multiplicity-free special case.
Differences from the source:
- encoding: orthonormal families of isometric embeddings , with orthogonal images spanning the target (290) → unitary block matrices whose columns are the embedded basis vectors, intertwining with the target action, with arbitrary multiplicity counts; reason: the same data
- encoding: "the circuit in Figure 20 implements " → as matrices, the product of the first three steps; reason: the formulation of the proof
Preamble
import Definitions.Def_GL2QFT_Supplement_MackeyMult open Classical open scoped Matrix
Formal statement
namespace GL2QFT
namespace Supplement
open Mackey MackeyMult
/-- arXiv:2608.28573 (held version, sha256 ecd45073…), **Theorem C.2 (Mackey induction with
multiplicities)**, p.87 (PDF p.88): "For every finite group `G`, subgroup `H ≤ G`, and `λ ∈ Ĥ`, the
circuit in Figure 20 implements `U^λ_Ind` in the bases fixed in Appendix C.1. Moreover, every block
`A_{λ,ν}` in Equation (294) is unitary."
Setting of Appendix C (pp.84–85): `Ω`, `H_ω`, `T_ω` and `T = ⊔ T_ω ω` as in Remark 5.2,
`n = [G:H]`, `n_ω = [H:H_ω]`; chosen representatives of the irreps of `H`, `G` and every `H_ω`; the
bases of the `G`-irreps subgroup-adapted to `H` with multiplicities (Definition B.1); no
multiplicity-freeness and no `H_ω`-adaptedness; any choice of the embeddings `L^ω_{κ,ν,m}` and
`E^ω_{λ,κ,e}` of (290). Then:
1. `A_λ N_λ = U^λ_Ind` (291), where `N_λ` is the first three steps of Figure 20 and
`A_λ = ⊕_ν I ⊗ A_{λ,ν}` with the blocks (294);
2. every block `A_{λ,ν}` is unitary: `A A† = I` and `A† A = I`. -/
theorem theorem_C_2 {G : Type} [Group G] [Fintype G] (H : Subgroup G) (Ω : Set G)
(hΩ : IsDoubleCosetTransversal H H Ω) (Tω : G → Set H)
(hTω : ∀ ω ∈ Ω, Subgroup.IsComplement (Tω ω) (interSub H ω : Set H))
{ΛH ΛG : Type} [Fintype ΛH] [Fintype ΛG] (BH : ΛH → Type) [∀ l, Fintype (BH l)]
[∀ l, DecidableEq (BH l)] (mult : ΛH → ΛG → ℕ)
(RH : ∀ l, H → Matrix (BH l) (BH l) ℂ) (hRH : IsIrrepSystem RH)
(RG : ∀ μ, G → Matrix (AdBasM BH mult μ) (AdBasM BH mult μ) ℂ) (hRG : IsIrrepSystem RG)
(hAd : IsAdaptedMult H BH mult RH RG)
{Λω : G → Type} [∀ ω, Fintype (Λω ω)] (Bω : ∀ ω, Λω ω → Type) [∀ ω κ, Fintype (Bω ω κ)]
[∀ ω κ, DecidableEq (Bω ω κ)]
(Rω : ∀ ω κ, interSub H ω → Matrix (Bω ω κ) (Bω ω κ) ℂ)
(hRω : ∀ ω ∈ Ω, IsIrrepSystem (Rω ω))
(mL : ∀ ω, ΛH → Λω ω → ℕ)
(Lmat : ∀ ω ν, Matrix (BH ν) (Σ κ : Λω ω, Fin (mL ω ν κ) × Bω ω κ) ℂ)
(hL : ∀ ω ∈ Ω, ∀ ν, IsEmbeddingFamily H Bω (fun h => RH ν (h : H)) (mL ω ν) (Rω ω)
(Lmat ω ν))
(mE : ∀ ω, ΛH → Λω ω → ℕ)
(Emat : ∀ ω l, Matrix (BH l) (Σ κ : Λω ω, Fin (mE ω l κ) × Bω ω κ) ℂ)
(hE : ∀ ω ∈ Ω, ∀ l, IsEmbeddingFamily H Bω (twistRep H ω (RH l)) (mE ω l) (Rω ω) (Emat ω l))
(l : ΛH) :
AopM H Ω BH mult Bω RG mL Lmat mE Emat l * NopM H Ω Tω BH Bω RH mL Lmat mE Emat l =
UIndMult H Ω Tω BH mult RG l ∧
∀ ν : ΛH,
AblockM H Ω BH mult Bω RG mL Lmat mE Emat l ν *
(AblockM H Ω BH mult Bω RG mL Lmat mE Emat l ν)ᴴ = 1 ∧
(AblockM H Ω BH mult Bω RG mL Lmat mE Emat l ν)ᴴ *
AblockM H Ω BH mult Bω RG mL Lmat mE Emat l ν = 1 := by sorry
end Supplement
end GL2QFT
Source
Bruinsma, Posta, Stokvis, Grinko, Ozols, Quantum Fourier transform toolbox, arXiv:2608.28573 (held version, sha256 ecd45073…), Theorem C.2, p.87 (PDF p.88); §C.1–C.2 eqs. (284)–(294) and Figure 20 pp.84–86; Definition B.1 p.81