Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered invariant composition criterion

Proved
QAlgorithms.Papers.Independent.Advance50.P50.equivariant_composition

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

prove2quantum

Let a group GGG act on spaces A0,…,AMA_0,\ldots,A_MA0​,…,AM​, and let fj:Aj→Aj+1f_j:A_j\to A_{j+1}fj​:Aj​→Aj+1​ be equivariant for 0≤j<M0\le j<M0≤j<M. Let q:AM→Bq:A_M\to Bq:AM​→B be invariant, where BBB has trivial action. The maps need not be linear or quantum channels. Then

q∘fM−1∘⋯∘f0(g⋅x)=q∘fM−1∘⋯∘f0(x).q\circ f_{M-1}\circ\cdots\circ f_0(g\cdot x)=q\circ f_{M-1}\circ\cdots\circ f_0(x).q∘fM−1​∘⋯∘f0​(g⋅x)=q∘fM−1​∘⋯∘f0​(x).

The constructed composition is invariant. When M=0M=0M=0, it is simply the final invariant map qqq.

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.16: equivariant intermediate maps followed by an invariant final
map yield an invariant model. M counts intermediate maps, so M=0 is allowed. -/
theorem equivariant_composition {G : Type*} [Group G] {A : ℕ → Type*} {B : Type*}
    (action : ∀ j, G → A j → A j)
    (haction : (∀ j x, action j 1 x = x) ∧
      ∀ j g h x, action j (g*h) x = action j g (action j h x))
    (M : ℕ) (f : ∀ j, A j → A (j+1)) (q : A M → B)
    (hequiv : ∀ j, j < M → ∀ g x, f j (action j g x) = action (j+1) g (f j x))
    (hfinal : ∀ g x, q (action M g x) = q x) :
    ∀ g x, q (composeLayers f M (action 0 g x)) = q (composeLayers f M x) := by sorry

end QAlgorithms.Papers.Independent.Advance50.P50

end
Source
Group-Invariant Quantum Machine Learning, arXiv:2205.02261v2, PDF p. 16, Unnumbered invariant composition criterion
Read-back

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

Let GGG be any group, let AjA_jAj​ be a type for each natural number jjj, and let BBB be any type. For every jjj, suppose an action aj:G×Aj→Aja_j:G\times A_j\to A_jaj​:G×Aj​→Aj​ satisfies aj(1,x)=xa_j(1,x)=xaj​(1,x)=x and aj(gh,x)=aj(g,aj(h,x))a_j(gh,x)=a_j(g,a_j(h,x))aj​(gh,x)=aj​(g,aj​(h,x)). For any natural number MMM, functions fj:Aj→Aj+1f_j:A_j\to A_{j+1}fj​:Aj​→Aj+1​ for every jjj, and function q:AM→Bq:A_M\to Bq:AM​→B, assume fj(aj(g,x))=aj+1(g,fj(x))f_j(a_j(g,x))=a_{j+1}(g,f_j(x))fj​(aj​(g,x))=aj+1​(g,fj​(x)) for every j<Mj<Mj<M, g∈Gg\in Gg∈G, and x∈Ajx\in A_jx∈Aj​, and assume q(aM(g,x))=q(x)q(a_M(g,x))=q(x)q(aM​(g,x))=q(x) for every g∈Gg\in Gg∈G and x∈AMx\in A_Mx∈AM​. Defining C0=id⁡C_0=\operatorname{id}C0​=id and Cm+1=fm∘CmC_{m+1}=f_m\circ C_mCm+1​=fm​∘Cm​, one has q(CM(a0(g,x)))=q(CM(x))q(C_M(a_0(g,x)))=q(C_M(x))q(CM​(a0​(g,x)))=q(CM​(x)) for every g∈Gg\in Gg∈G and x∈A0x\in A_0x∈A0​. The case M=0M=0M=0 is included, with no equivariance conditions on the fjf_jfj​.

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