Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pure states, classical basis states and the classical state space

Definition
hardy2001_states

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

convex-geometrymathematical-physicsquantum-foundations

Let S⊆RKS\subseteq\mathbb R^KS⊆RK be a set of (unnormalized) state vectors. Its set of pure states is

Spure=ext⁡(S)∖{0},S_{\rm pure}=\operatorname{ext}(S)\setminus\{0\},Spure​=ext(S)∖{0},

the extremal points of SSS other than the null state 000. A point is extremal if it is not a proper convex combination of two other points of SSS.

For a dimension NNN, the basis states of classical probability theory are the unit vectors en∈RNe_n\in\mathbb R^Nen​∈RN, with a 111 in position nnn and 000 elsewhere. The classical state space is

SNcl={p∈RN: pn≥0 for all n,  ∑npn≤1}.S^{\rm cl}_N=\Big\{p\in\mathbb R^N:\ p_n\ge0\ \text{for all }n,\ \ \sum_{n}p_n\le1\Big\}.SNcl​={p∈RN: pn​≥0 for all n,  n∑​pn​≤1}.

This is the convex hull of the basis states and the null state.

These are the objects of Sections 4 and 6.9 of the paper: pure states are the definite states of a system, and the classical state space is a polytope.

Formalization Note Extremal points are Mathlib's Set.extremePoints ℝ S. Basis states are indexed by Fin N, so the paper's state nnn is index n−1n-1n−1.

Definition code
import Mathlib

namespace HardyFiveAxioms

/-- The pure states of a set `S` of (unnormalized) state vectors `p ∈ ℝᴷ`: the extremal points
of `S` other than the null state `0` (Hardy 2001, Section 6.9). -/
def pureStates {K : ℕ} (S : Set (Fin K → ℝ)) : Set (Fin K → ℝ) :=
  Set.extremePoints ℝ S \ {0}

/-- The `n`-th basis state of classical probability theory in dimension `N`: the vector with a
`1` in position `n` and `0` elsewhere (Hardy 2001, Eq. (2)). -/
def basisState {N : ℕ} (n : Fin N) : Fin N → ℝ :=
  Pi.single n 1

/-- The state space of classical probability theory in dimension `N` (Hardy 2001, Section 4):
the convex hull of the `N` basis states and the null state, i.e. the vectors `p ∈ ℝᴺ` with
nonnegative entries whose sum (the normalization coefficient) is at most `1`. -/
def classicalStates (N : ℕ) : Set (Fin N → ℝ) :=
  {p | (∀ n, 0 ≤ p n) ∧ ∑ n, p n ≤ 1}

end HardyFiveAxioms
Source
L. Hardy, *Quantum Theory From Five Reasonable Axioms*, arXiv:quant-ph/0101012v4 (2001), https://arxiv.org/abs/quant-ph/0101012, pp. 4–5, Section 4, Eq. (2) and the sentence defining pure states; p. 12, Section 6.9
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 statement below, with full knowledge of the source paper and of the intended meaning. It was not produced by a blind, independent auditor, so it may share the drafter's blind spots. Reviewers must not treat it as independent confirmation of faithfulness; compare the Lean code against the source directly.

Three objects are defined.

  1. For a natural number KKK and a set SSS of real vectors p∈RKp\in\mathbb R^Kp∈RK (functions from {0,…,K−1}\{0,\dots,K-1\}{0,…,K−1} to R\mathbb RR), pure(S)\mathrm{pure}(S)pure(S) is the set of points p∈Sp\in Sp∈S that are extreme points of SSS and are different from the zero vector. Here p∈Sp\in Sp∈S is an extreme point when, whenever ppp lies in the open segment between two points x,y∈Sx,y\in Sx,y∈S, one has x=px=px=p and y=py=py=p. No convexity, boundedness or closedness of SSS is assumed. If SSS is empty, or S={0}S=\{0\}S={0}, the set of pure states is empty.
  2. For N∈NN\in\mathbb NN∈N and an index n∈{0,…,N−1}n\in\{0,\dots,N-1\}n∈{0,…,N−1}, en∈RNe_n\in\mathbb R^Nen​∈RN is the vector with 111 in coordinate nnn and 000 in every other coordinate.
  3. For N∈NN\in\mathbb NN∈N, SNclS^{\rm cl}_NSNcl​ is the set of p∈RNp\in\mathbb R^Np∈RN with pn≥0p_n\ge0pn​≥0 for every nnn and ∑n=0N−1pn≤1\sum_{n=0}^{N-1}p_n\le1∑n=0N−1​pn​≤1. For N=0N=0N=0 it consists of the single (empty) vector.
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