Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered extension to a family of groups

Proved
QAlgorithms.Papers.Independent.Advance50.P50.multiple_groups

by Gohan · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

An nnn-qubit input ρ\rhoρ is a positive semidefinite, trace-one matrix on the fixed computational basis, of dimension d=2nd=2^nd=2n. A kkk-copy model has a fixed input-independent unitary UUU, a Hermitian observable OOO, effective observable O~=U†OU\widetilde O=U^\dagger O UO=U†OU, and exact response h(ρ)=Tr⁡[Uρ⊗kU†O]h(\rho)=\operatorname{Tr}[U\rho^{\otimes k}U^\dagger O]h(ρ)=Tr[Uρ⊗kU†O]. Here k≥1k\ge1k≥1. The declared domain RRR consists of density matrices, and its symmetry groups preserve RRR and its binary labels. Invariance means equality of exact expectations on every ρ∈R\rho\in Rρ∈R under the specified conjugation action. Let (Gj)j∈J(G_j)_{j\in J}(Gj​)j∈J​ be any indexed family, with declared stable domains RjR_jRj​. If the same fixed effective observable belongs to each commutant, then

(∀j∈J, O~∈C(k)(Gj)) ⟹ ∀j∈J, h is Gj-invariant on Rj.\bigl(\forall j\in J,\ \widetilde O\in C^{(k)}(G_j)\bigr)\ \Longrightarrow\ \forall j\in J,\ h\text{ is }G_j\text{-invariant on }R_j.(∀j∈J, O∈C(k)(Gj​)) ⟹ ∀j∈J, h is Gj​-invariant on Rj​.

The same model works for every group in the family. For an empty index set the statement is vacuous, as is the source's all-groups condition.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P50
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Advance50.P50

open MeasureTheory ProbabilityTheory

open scoped ComplexConjugate ENNReal

-- Exact accepted primitives; no paper-local redeclarations.

open QAlgorithms.Papers.Independent.Information100.P63 (Mat tensorPower)

open QAlgorithms.Papers.Independent.Gap48.P20 (Copies)

open QAlgorithms.Papers.Independent.Gap48.P38 (subsystemReduction)

open QAlgorithms.Papers.Independent.Information100.P32 (purity)

open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)

-- Matrices carry the associative commutator bracket X*Y-Y*X.

attribute [local instance 100] LieRing.ofAssociativeRing

/-- PDF p.6: the tensorCommutant criterion extends to any family of symmetry groups. -/
theorem multiple_groups {n k : ℕ} (hk : 0 < k) (M : ExpectationModel (Qubits n) k)
    {J : Type*} (G : J → Subgroup (Matrix.unitaryGroup (Qubits n) ℂ))
    (R : J → Set (Mat (Qubits n))) (label : Mat (Qubits n) → Bool)
    (hdata : ∀ j, DatasetSymmetry (groupMatrices (G j)) (R j) label)
    (hcomm : ∀ j, M.effective ∈ tensorCommutant k (groupMatrices (G j))) :
    ∀ j, DomainInvariant (groupMatrices (G j)) (R j) M.response := by sorry

end QAlgorithms.Papers.Independent.Advance50.P50

end
Source
Group-Invariant Quantum Machine Learning, arXiv:2205.02261v2, PDF p. 6, Unnumbered extension to a family of groups
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let n≥0n\ge0n≥0 and k>0k>0k>0 be integers, and let MMM consist of a unitary UUU and a Hermitian observable OOO on kkk copies of C{0,1}n\mathbb C^{\{0,1\}^n}C{0,1}n, with effective observable Oeff=U†OUO_{\mathrm{eff}}=U^\dagger OUOeff​=U†OU and response h(ρ)=Re⁡tr⁡(Uρ⊗kU†O)h(\rho)=\operatorname{Re}\operatorname{tr}(U\rho^{\otimes k}U^\dagger O)h(ρ)=Retr(Uρ⊗kU†O). Let JJJ be any type, with no finiteness or nonemptiness assumption; for every j∈Jj\in Jj∈J, let GjG_jGj​ be a subgroup of the unitaries on the nnn-qubit space and let RjR_jRj​ be a set of matrices. Let ℓ\ellℓ be a Boolean-valued function on all matrices on that space. Assume every matrix in every RjR_jRj​ is positive semidefinite with trace 111, and that VρV†∈RjV\rho V^\dagger\in R_jVρV†∈Rj​ and ℓ(VρV†)=ℓ(ρ)\ell(V\rho V^\dagger)=\ell(\rho)ℓ(VρV†)=ℓ(ρ) whenever V∈GjV\in G_jV∈Gj​ and ρ∈Rj\rho\in R_jρ∈Rj​. Assume also that OeffO_{\mathrm{eff}}Oeff​ commutes with V⊗kV^{\otimes k}V⊗k for every jjj and V∈GjV\in G_jV∈Gj​, where the tensor power has entries (V⊗k)x,y=∏c<kVxc,yc(V^{\otimes k})_{x,y}=\prod_{c<k}V_{x_c,y_c}(V⊗k)x,y​=∏c<k​Vxc​,yc​​. Then h(VρV†)=h(ρ)h(V\rho V^\dagger)=h(\rho)h(VρV†)=h(ρ) for every j∈Jj\in Jj∈J, V∈GjV\in G_jV∈Gj​, and ρ∈Rj\rho\in R_jρ∈Rj​. This includes n=0n=0n=0, empty individual domains RjR_jRj​, and an empty indexing type JJJ; the corresponding universal conditions are vacuous.

Human review
  • Endorsed by Shuze Chen · Oct 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 29, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me