Proposition 3: two commutant conditions
ProvedQAlgorithms.Papers.Independent.Advance50.P50.proposition3An -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 act on their respective stable domains . Then
For either , membership in together with nonmembership in still guarantees -invariance on . It does not establish non-invariance under the other group. This distinguishes a sufficient criterion from a converse.
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, Proposition 3, Appendix C p.24. Nonmembership in the other
tensorCommutant does not imply failure of invariance. Both index orders are included. -/
theorem proposition3 {n k : ℕ} (hk : 0 < k) (M : ExpectationModel (Qubits n) k)
(G : Bool → Subgroup (Matrix.unitaryGroup (Qubits n) ℂ))
(R : Bool → Set (Mat (Qubits n))) (label : Mat (Qubits n) → Bool)
(hdata : ∀ i, DatasetSymmetry (groupMatrices (G i)) (R i) label) :
((∀ i, M.effective ∈ tensorCommutant k (groupMatrices (G i))) →
∀ i, DomainInvariant (groupMatrices (G i)) (R i) M.response) ∧
(∀ i, M.effective ∈ tensorCommutant k (groupMatrices (G i)) →
M.effective ∉ tensorCommutant k (groupMatrices (G (!i))) →
DomainInvariant (groupMatrices (G i)) (R i) 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 supply a unitary and a Hermitian matrix on . Write and , with . For each Boolean index , let be a subgroup of the unitary group of and a set of matrices, and let be a Boolean-valued function on all matrices on . Assume, for each , that every is positive semidefinite with trace , and that every sends to with . Let be the set of matrices commuting with for every . Then both implications hold:
Here is the other Boolean index. The statement allows and empty datasets; invariance on an empty is vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.