Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 13 — for dA=2d_A=2dA​=2 the normalized states form the Bloch ball and GA≅SO(3)G_A\cong SO(3)GA​≅SO(3)

Open
InfoDerivQT.bloch_sphere

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

operational-probabilistic-theoriesquantum-foundationsquantum-information

Let TTT satisfy the six principles and let AAA be a system with a maximal set of two perfectly distinguishable pure states (dA=2d_A=2dA​=2). Then there is an affine map f:StR(A)→R3f:\mathrm{St}_{\mathbb R}(A)\to\mathbb R^3f:StR​(A)→R3, injective on St1(A)\mathrm{St}_1(A)St1​(A), such that

f(St1(A))={x∈R3: x12+x22+x32≤1},f\big(\mathrm{St}_1(A)\big)=\{x\in\mathbb R^3:\ x_1^2+x_2^2+x_3^2\le1\},f(St1​(A))={x∈R3: x12​+x22​+x32​≤1},

and the reversible transformations act on f(St1(A))f(\mathrm{St}_1(A))f(St1​(A)) exactly as the rotation group:

  1. for every reversible U\mathcal UU of AAA there is R∈SO(3)R\in SO(3)R∈SO(3) with f(Uρ)=Rf(ρ)f(\mathcal U\rho)=Rf(\rho)f(Uρ)=Rf(ρ) for all ρ∈St1(A)\rho\in\mathrm{St}_1(A)ρ∈St1​(A);
  2. for every R∈SO(3)R\in SO(3)R∈SO(3) there is a reversible U\mathcal UU of AAA with f(Uρ)=Rf(ρ)f(\mathcal U\rho)=Rf(\rho)f(Uρ)=Rf(ρ) for all ρ∈St1(A)\rho\in\mathrm{St}_1(A)ρ∈St1​(A).

Formalization Note "Sphere" in the paper refers to the Bloch ball, whose boundary sphere is the set of pure states.

Preamble
import Mathlib
import Definitions.Def_InfoDerivQT_principles
Formal statement
namespace InfoDerivQT
theorem bloch_sphere (T : OPT) (hT : T.SatisfiesPrinciples) (A : T.Sys)
    (φ : Fin 2 → Vec (T.size A)) (hφ : T.IsMaximalPerfDistPure A φ) :
    ∃ f : Vec (T.size A) →ᵃ[ℝ] (Fin 3 → ℝ),
      Set.InjOn f (T.St1 A) ∧ f '' T.St1 A = {x | ∑ i, x i ^ 2 ≤ 1} ∧
      (∀ U : Vec (T.size A) →ₗ[ℝ] Vec (T.size A), T.IsReversible A A U →
        ∃ R ∈ Matrix.specialOrthogonalGroup (Fin 3) ℝ,
          ∀ ρ ∈ T.St1 A, f (U ρ) = Matrix.mulVec (R : Matrix (Fin 3) (Fin 3) ℝ) (f ρ)) ∧
      (∀ R ∈ Matrix.specialOrthogonalGroup (Fin 3) ℝ,
        ∃ U : Vec (T.size A) →ₗ[ℝ] Vec (T.size A), T.IsReversible A A U ∧
          ∀ ρ ∈ T.St1 A, f (U ρ) = Matrix.mulVec (R : Matrix (Fin 3) (Fin 3) ℝ) (f ρ)) := 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-22, Sec. X, Theorem 13 (The Bloch sphere)
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, and a maximal perfectly distinguishable family of pure states φ0,φ1\varphi_0,\varphi_1φ0​,φ1​ of AAA with exactly two members. The conclusion is that there exists a real-affine map f:RDA→R3f:\mathbb R^{D_A}\to\mathbb R^3f:RDA​→R3 such that: (i) fff is injective on the set of deterministic states of AAA; (ii) the image under fff of the set of deterministic states is exactly the closed Euclidean unit ball {x: x12+x22+x32≤1}\{x:\ x_1^2+x_2^2+x_3^2\le1\}{x: x12​+x22​+x32​≤1}; (iii) for every linear map U\mathcal UU of RDA\mathbb R^{D_A}RDA​ that is a reversible transformation of AAA there is a real 3×33\times33×3 matrix RRR in the special orthogonal group (RTR=IR^{\mathsf T}R=IRTR=I, det⁡R=1\det R=1detR=1) with f(Uρ)=Rf(ρ)f(\mathcal U\rho)=Rf(\rho)f(Uρ)=Rf(ρ) for every deterministic state ρ\rhoρ; (iv) conversely, for every such RRR there is a reversible transformation U\mathcal UU of AAA with f(Uρ)=Rf(ρ)f(\mathcal U\rho)=Rf(\rho)f(Uρ)=Rf(ρ) for every deterministic state ρ\rhoρ.

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