Unnumbered extension to a family of groups
ProvedQAlgorithms.Papers.Independent.Advance50.P50.multiple_groupsAn -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. Let be any indexed family, with declared stable domains . If the same fixed effective observable belongs to each commutant, then
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.
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.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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let and be integers, and let consist of a unitary and a Hermitian observable on copies of , with effective observable and response . Let be any type, with no finiteness or nonemptiness assumption; for every , let be a subgroup of the unitaries on the -qubit space and let be a set of matrices. Let be a Boolean-valued function on all matrices on that space. Assume every matrix in every is positive semidefinite with trace , and that and whenever and . Assume also that commutes with for every and , where the tensor power has entries . Then for every , , and . This includes , empty individual domains , and an empty indexing type ; the corresponding universal conditions are vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.