Theorem 6.3 — Weyl criterion (odd prime ): surjective -homomorphism iff , ,
OpenRelDecoding.Supplement.theorem_6_3operator-algebrasp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-informationrelative-decoding
Let be an odd prime, , the Weyl operators (exponents in ). Choose nonzero Weyl directions , and phases , and set , for , , likewise, , , , over , and (resp. ), for .
- The assignment (, ) extends to a surjective unital -homomorphism if and only if
where . 2. For the matched Hamiltonians , , with nonempty symmetric symbol sets , and , every such map satisfies
for every polynomial .
This extends the homomorphism criterion to prime-dimensional qudits and occupation-truncated bosonic systems, where the powers along one Weyl direction form a single -valued coordinate.
Differences from the source:
- encoding: p an odd prime → [Fact p.Prime] and p ≠ 2; reason: same primes
- encoding: A = C∗(I_A, aᵢ(ξ) : i ∈ [s], ξ ∈ F_p), π_p : A → B surjective unital ∗-homomorphism with π_p(aᵢ(ξ)) = bᵢ(ξ) → familyAlg (weylGen rA wA), the ∗-subalgebra generated by the family indexed by Fin s × ZMod p; π : familyAlg … →⋆ₐ[ℂ] familyAlg … with π (familyGen a (i, ξ)) = familyGen b (i, ξ) and Function.Surjective π; reason: in finite dimension the generated ∗-subalgebra is the generated C∗-algebra (App. E, p.85)
- encoding: ω^{x·z/2} with exponents in F_p; labels (x, z) ∈ F_p^{2m} → ω^{k.val} for k : ZMod p with /2 = · (2 : ZMod p)⁻¹; labels as pairs (Fin m → ZMod p) × (Fin m → ZMod p), columns of the label matrix x then z (Fin m ⊕ Fin m); reason: ω^p = 1, so ω^k is well defined on F_p; same operators and matrices
- encoding: ζ_A(c) = ζ_B(c) for c ∈ K_A, where W_L(c) = ζ_L(c) I for c ∈ K_L → ∀ c ∈ K_A, ∀ ζ : ℂ, W_A(c) = ζ • 1 → W_B(c) = ζ • 1; reason: for c ∈ K_A the word W_A(c) is scalar, so ζ_A(c) is the unique ζ with W_A(c) = ζI (the matrix algebras are nonzero); the implication then says W_B(c) = ζ_A(c)I, i.e. ζ_B(c) = ζ_A(c)
- encoding: Λᵢ = −Λᵢ ⊆ F_p^× nonempty, λ_{i,−ξ} = λ_{i,ξ}^∗, polynomials p₀ → Λ i : Finset (ZMod p) nonempty, 0 ∉ Λ i, closed under negation; lam i (−ξ) = star (lam i ξ) for ξ ∈ Λ i; p₀ : Polynomial ℂ evaluated by Polynomial.aeval; reason: Lean convention; same Hamiltonians and identities
Preamble
import Mathlib import Definitions.Def_RelDecoding_Supplement_labelKer import Definitions.Def_RelDecoding_Supplement_weylGen set_option autoImplicit false open scoped Matrix
Formal statement
namespace RelDecoding.Supplement
/-- **Theorem 6.3 (Homomorphisms between Weyl-generated algebras).** Let `p` be an odd prime,
`wᵢ ∈ F_p^{2m_A}`, `vᵢ ∈ F_p^{2m_B}` nonzero Weyl directions and `rᵢᴬ, rᵢᴮ ∈ F_p` phases, with
field-symbol generators `aᵢ(ξ) = ω^{ξrᵢᴬ} W_{m_A}(ξwᵢ)`, `bᵢ(ξ) = ω^{ξrᵢᴮ} W_{m_B}(ξvᵢ)` (248),
`A = C∗(I_A, aᵢ(ξ) : i ∈ [s], ξ ∈ F_p)`, `B` likewise (253), label matrices `A = [w₁ ⋯ w_s]`,
`B = [v₁ ⋯ v_s]`, kernels `K_A`, `K_B` over `F_p` and words `W_L(c) = a₁(c₁)⋯a_s(c_s)`
(`= ζ_L(c) I_L` for `c ∈ K_L`). The assignment `aᵢ(ξ) ↦ bᵢ(ξ)` (`i ∈ [s]`, `ξ ∈ F_p`) (260) extends
to a surjective unital ∗-homomorphism `π_p : A → B` if and only if
`AᵀΩ_{m_A}A = BᵀΩ_{m_B}B`, `K_A ⊆ K_B`, `ζ_A(c) = ζ_B(c)` (`c ∈ K_A`) (261). For the matched
Hamiltonians `H_A^{(p)} = E_c I_A + Σᵢ Σ_{ξ∈Λᵢ} λ_{i,ξ} aᵢ(ξ)`, `H_B^{(p)}` likewise, with
`Λᵢ = −Λᵢ ⊆ F_p^×` nonempty, `λ_{i,−ξ} = λ_{i,ξ}^*`, `E_c ∈ ℝ` (252), this gives
`π_p(H_A^{(p)}) = H_B^{(p)}` and `π_p(p₀(H_A^{(p)})) = p₀(H_B^{(p)})` for every polynomial `p₀` (262).
Shang, Stilck França, *From Simple Sources to Quantum Advantage: Homomorphic Polynomial
Transduction via Relative Decoding*, arXiv:2609.35101 (held version, sha256 d2be7859…),
Theorem 6.3, p.47 (setting eqs. (225)–(226), p.43, and (246)–(259), pp.46–47; proof Proposition E.4,
pp.89–90).
**Formalization Note.** `W_m` is `weylOp` on the basis `Fin m → ZMod p`; the generators form the
family `weylGen r w : Fin s × ZMod p → Matrix`, and `A = familyAlg (weylGen rA wA)`. `π_p` is a
unital ∗-homomorphism `A →⋆ₐ[ℂ] B` with `π_p(a_{(i,ξ)}) = b_{(i,ξ)}` for every `(i, ξ)` and
`Function.Surjective π_p`. Labels are pairs `(x, z)`, read as columns of `F_p^{2m}` X-part first.
The phase condition is encoded as: for `c ∈ K_A`, `W_A(c) = ζI_A` implies `W_B(c) = ζI_B`.
Polynomials are complex, `p₀ ∈ ℂ[X]`. -/
theorem theorem_6_3 {p mA mB s : ℕ} [Fact p.Prime] (hp : p ≠ 2)
(wA : Fin s → (Fin mA → ZMod p) × (Fin mA → ZMod p)) (rA : Fin s → ZMod p)
(wB : Fin s → (Fin mB → ZMod p) × (Fin mB → ZMod p)) (rB : Fin s → ZMod p)
(hwA : ∀ i, wA i ≠ 0) (hwB : ∀ i, wB i ≠ 0) :
((∃ π : familyAlg (weylGen rA wA) →⋆ₐ[ℂ] familyAlg (weylGen rB wB),
(∀ q, π (familyGen (weylGen rA wA) q) = familyGen (weylGen rB wB) q) ∧
Function.Surjective π) ↔
((labelMatrix fun i => pairVec (wA i))ᵀ * omegaForm mA p *
labelMatrix (fun i => pairVec (wA i)) =
(labelMatrix fun i => pairVec (wB i))ᵀ * omegaForm mB p *
labelMatrix (fun i => pairVec (wB i)) ∧
labelKer (fun i => pairVec (wA i)) ≤ labelKer (fun i => pairVec (wB i)) ∧
∀ c ∈ labelKer (fun i => pairVec (wA i)), ∀ ζ : ℂ,
symbolWord (weylGen rA wA) c = ζ • 1 → symbolWord (weylGen rB wB) c = ζ • 1)) ∧
∀ π : familyAlg (weylGen rA wA) →⋆ₐ[ℂ] familyAlg (weylGen rB wB),
(∀ q, π (familyGen (weylGen rA wA) q) = familyGen (weylGen rB wB) q) →
Function.Surjective π →
∀ (Ec : ℝ) (Λ : Fin s → Finset (ZMod p)) (lam : Fin s → ZMod p → ℂ),
(∀ i, (Λ i).Nonempty) → (∀ i, (0 : ZMod p) ∉ Λ i) →
(∀ i, ∀ ξ ∈ Λ i, -ξ ∈ Λ i) →
(∀ i, ∀ ξ ∈ Λ i, lam i (-ξ) = star (lam i ξ)) →
((π ((Ec : ℂ) • (1 : familyAlg (weylGen rA wA)) +
∑ i, ∑ ξ ∈ Λ i, lam i ξ • familyGen (weylGen rA wA) (i, ξ)) :
Matrix (Fin mB → ZMod p) (Fin mB → ZMod p) ℂ) =
(Ec : ℂ) • (1 : Matrix (Fin mB → ZMod p) (Fin mB → ZMod p) ℂ) +
∑ i, ∑ ξ ∈ Λ i, lam i ξ • weylGen rB wB (i, ξ)) ∧
∀ p₀ : Polynomial ℂ,
((π (Polynomial.aeval ((Ec : ℂ) • (1 : familyAlg (weylGen rA wA)) +
∑ i, ∑ ξ ∈ Λ i, lam i ξ • familyGen (weylGen rA wA) (i, ξ)) p₀) :
Matrix (Fin mB → ZMod p) (Fin mB → ZMod p) ℂ) =
Polynomial.aeval ((Ec : ℂ) • (1 : Matrix (Fin mB → ZMod p) (Fin mB → ZMod p) ℂ) +
∑ i, ∑ ξ ∈ Λ i, lam i ξ • weylGen rB wB (i, ξ)) p₀) := by sorry
end RelDecoding.Supplement
Source
Shang, Stilck França, From Simple Sources to Quantum Advantage: Homomorphic Polynomial Transduction via Relative Decoding, arXiv:2609.35101 (held version, sha256 d2be7859…), Theorem 6.3, p.47 (pdf_page 47); setting eqs. (225)–(226), p.43, and (246)–(259), pp.46–47; proof Proposition E.4, pp.89–90