Seed paper result: Proposition 1, commutant sufficient condition
ProvedQAlgorithms.Papers.Independent.Advance50.P50.proposition1An -qubit input is a positive semidefinite, trace-one matrix on the fixed computational basis, of dimension . A -copy model has a fixed input-independent unitary , a Hermitian observable , effective observable , and exact response . Here . The declared domain consists of density matrices, and its symmetry groups preserve and its binary labels. Invariance means equality of exact expectations on every under the specified conjugation action. Write . Then
This is a sufficient structural condition for invariance; no converse is asserted.
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P50
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.5, Proposition 1: tensorCommutant membership suffices for domain-relative invariance. -/
theorem proposition1 {n k : ℕ} (hk : 0 < k) (M : ExpectationModel (Qubits n) k)
(G : Subgroup (Matrix.unitaryGroup (Qubits n) ℂ))
(R : Set (Mat (Qubits n))) (label : Mat (Qubits n) → Bool)
(hdata : DatasetSymmetry (groupMatrices G) R label)
(hcomm : M.effective ∈ tensorCommutant k (groupMatrices G)) :
DomainInvariant (groupMatrices G) R M.response := by sorry
end QAlgorithms.Papers.Independent.Advance50.P50
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be natural numbers with , let be the complex Euclidean space indexed by -bit strings, and let an expectation model consist of a unitary on and a Hermitian matrix on that space. Write and , where . Let be any subgroup of the unitary group of , let be any set of matrices on , and let be any Boolean-valued function on those matrices. Assume every is positive semidefinite with trace , and that for every and , both and . Assume also that commutes with for every . Then
The statement allows and does not require to be nonempty; for empty , the dataset assumptions and conclusion are vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.