Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1: no informative one-copy purity model

Proved
QAlgorithms.Papers.Independent.Advance50.P50.theorem1

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

prove2quantum

An nnn-qubit input ρ\rhoρ is a positive semidefinite, trace-one matrix on the fixed computational basis, of dimension d=2nd=2^nd=2n. A kkk-copy model has a fixed input-independent unitary UUU, a Hermitian observable OOO, effective observable O~=U†OU\widetilde O=U^\dagger O UO=U†OU, and exact response h(ρ)=Tr⁡[Uρ⊗kU†O]h(\rho)=\operatorname{Tr}[U\rho^{\otimes k}U^\dagger O]h(ρ)=Tr[Uρ⊗kU†O]. Fix n≥1n\ge1n≥1, d=2nd=2^nd=2n, and 1/d≤b<11/d\le b<11/d≤b<1, with nonempty classes of purity 111 and bbb. Write RbR_bRb​ for their union and p(ρ)=Tr⁡(ρ2)p(\rho)=\operatorname{Tr}(\rho^2)p(ρ)=Tr(ρ2). For k=1k=1k=1, if the model is U(d)U(d)U(d)-invariant on RbR_bRb​, then

h(ρ)=Tr⁡Od(ρ∈Rb).h(\rho)=\frac{\operatorname{Tr}O}{d}\qquad(\rho\in R_b).h(ρ)=dTrO​(ρ∈Rb​).

Every prediction is the same, so the model provides no label information. This applies to the stated single-unitary, single-expectation hypothesis class and asserts no impossibility for broader adaptive protocols.

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 pp.6–7, Theorem 1 and Eq.(11): an invariant one-copy expectation is
constant on the full purity dataset and cannot convey label information. -/
theorem theorem1 {n : ℕ} (hn : 1 ≤ n) (b : ℝ)
    (hb : 1 / (2 : ℝ) ^ n ≤ b ∧ b < 1)
    (hpure : ∃ rho : Mat (Qubits n), IsDensityMatrix rho ∧ purity rho = 1)
    (hmixed : ∃ rho : Mat (Qubits n), IsDensityMatrix rho ∧ purity rho = b)
    (M : ExpectationModel (Qubits n) 1)
    (hinv : DomainInvariant (Matrix.unitaryGroup (Qubits n) ℂ : Set (Mat (Qubits n)))
      (purityDomain b) M.response) :
    ∀ rho ∈ purityDomain b, M.response rho = M.observable.trace.re / (2 : ℝ) ^ n := by sorry

end QAlgorithms.Papers.Independent.Advance50.P50

end
Source
Group-Invariant Quantum Machine Learning, arXiv:2205.02261v2, PDF p. 6, Theorem 1: no informative one-copy purity model
Read-back

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

For every integer n≥1n\ge1n≥1 and real number bbb satisfying 2−n≤b<12^{-n}\le b<12−n≤b<1, assume there exists a positive semidefinite trace-one matrix of purity 111 and there exists such a matrix of purity bbb, where the purity of XXX is Re⁡tr⁡(X2)\operatorname{Re}\operatorname{tr}(X^2)Retr(X2). Let MMM consist of a unitary UUU and a Hermitian observable OOO on one copy of the nnn-qubit space, and define its response by h(ρ)=Re⁡tr⁡(UρU†O)h(\rho)=\operatorname{Re}\operatorname{tr}(U\rho U^\dagger O)h(ρ)=Retr(UρU†O). Suppose h(VρV†)=h(ρ)h(V\rho V^\dagger)=h(\rho)h(VρV†)=h(ρ) for every unitary VVV and every positive semidefinite trace-one ρ\rhoρ whose purity is either 111 or bbb. Then, for every such ρ\rhoρ,

h(ρ)=Re⁡tr⁡O2n.h(\rho)=\frac{\operatorname{Re}\operatorname{tr}O}{2^n}.h(ρ)=2nRetrO​.

The endpoint b=2−nb=2^{-n}b=2−n is included, while b=1b=1b=1 and n=0n=0n=0 are excluded.

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