Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 32 — all maximal sets of perfectly distinguishable pure states have the same size

Open
InfoDerivQT.maximal_sets_same_card

by Lucas · Oct 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

operational-probabilistic-theoriesquantum-foundationsquantum-information

Let TTT satisfy the six principles and AAA a system. If {φi}i=1N\{\varphi_i\}_{i=1}^N{φi​}i=1N​ and {ψj}j=1M\{\psi_j\}_{j=1}^M{ψj​}j=1M​ are both maximal sets of perfectly distinguishable pure states of AAA, then

N=M.N=M.N=M.

The common value is the informational dimension dAd_AdA​ of the system.

Preamble
import Mathlib
import Definitions.Def_InfoDerivQT_principles
Formal statement
namespace InfoDerivQT
theorem maximal_sets_same_card (T : OPT) (hT : T.SatisfiesPrinciples) (A : T.Sys)
    {N M : ℕ} (φ : Fin N → Vec (T.size A)) (ψ : Fin M → Vec (T.size A))
    (hφ : T.IsMaximalPerfDistPure A φ) (hψ : T.IsMaximalPerfDistPure A ψ) :
    N = M := by sorry
end InfoDerivQT
Source
G. Chiribella, G. M. D'Ariano, P. Perinotti, *Informational derivation of quantum theory*, Phys. Rev. A 84, 012311 (2011), https://doi.org/10.1103/PhysRevA.84.012311 (arXiv:1011.6451), p. 012311-16, Sec. VII, Lemma 32
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic)

NON-BLIND READ-BACK — NOT INDEPENDENT TESTIMONY. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statements, with full knowledge of the source paper and of the intended meaning. It is not a blind audit and must not be mistaken for independent testimony; an independent, blind read-back should replace it before the proposal is relied upon.

Fix TTT satisfying all six principles, a system AAA, natural numbers N,MN,MN,M and families φ:{0,…,N−1}→RDA\varphi:\{0,\dots,N-1\}\to\mathbb R^{D_A}φ:{0,…,N−1}→RDA​, ψ:{0,…,M−1}→RDA\psi:\{0,\dots,M-1\}\to\mathbb R^{D_A}ψ:{0,…,M−1}→RDA​. Assume each family is a maximal perfectly distinguishable family of pure states: all members are deterministic states, there is an observation test indexed by the same set with aj(φi)=δija_j(\varphi_i)=\delta_{ij}aj​(φi​)=δij​, no deterministic state can be appended keeping the family perfectly distinguishable, and every member is pure (all its refinements in preparation tests are nonnegative multiples of it). The conclusion is N=MN=MN=M. Neither NNN nor MMM is required to be positive.

Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 8, 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