Unnumbered invariant composition criterion
ProvedQAlgorithms.Papers.Independent.Advance50.P50.equivariant_compositionprove2quantum
Let a group act on spaces , and let be equivariant for . Let be invariant, where has trivial action. The maps need not be linear or quantum channels. Then
The constructed composition is invariant. When , it is simply the final invariant map .
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 be any group, let be a type for each natural number , and let be any type. For every , suppose an action satisfies and . For any natural number , functions for every , and function , assume for every , , and , and assume for every and . Defining and , one has for every and . The case is included, with no equivariance conditions on the .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.