Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Reversible transformations send pure states to pure states

Proved
HardyFiveAxioms.reversible_maps_pure_to_pure

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 states and let ZZZ be an invertible real K×KK\times KK×K matrix such that both ZZZ and Z−1Z^{-1}Z−1 map SSS into itself (a reversible transformation). If ppp is a pure state of SSS, i.e. an extremal point of SSS other than 000, then

Zp∈Spure.Zp\in S_{\rm pure}.Zp∈Spure​.

Formalization Note "Z−1Z^{-1}Z−1 exists and is in Γ\GammaΓ" is encoded as invertibility of ZZZ together with Z−1S⊆SZ^{-1}S\subseteq SZ−1S⊆S. Pure states are as in the definition file hardy2001_states.

Preamble
import Mathlib
import Definitions.Def_hardy2001_states
Formal statement
namespace HardyFiveAxioms

open Matrix

/-- Hardy 2001, Section 7: a reversible transformation (an invertible matrix `Z` such that both
`Z` and `Z⁻¹` map the state space `S` into itself) sends pure states to pure states. -/
theorem reversible_maps_pure_to_pure {K : ℕ} (S : Set (Fin K → ℝ))
    (Z : Matrix (Fin K) (Fin K) ℝ) (hZ : IsUnit Z)
    (hZS : ∀ p ∈ S, Z *ᵥ p ∈ S) (hZinvS : ∀ p ∈ S, Z⁻¹ *ᵥ p ∈ S)
    (p : Fin K → ℝ) (hp : p ∈ pureStates S) :
    Z *ᵥ p ∈ pureStates S := by sorry

end HardyFiveAxioms
Source
L. Hardy, *Quantum Theory From Five Reasonable Axioms*, arXiv:quant-ph/0101012v4 (2001), https://arxiv.org/abs/quant-ph/0101012, p. 15, Section 7, paragraph 'If a reversible transformation is applied to a pure state it must necessarily output a pure state'
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.

Let K∈NK\in\mathbb NK∈N, let S⊆RKS\subseteq\mathbb R^KS⊆RK be any set (no convexity assumed), and let ZZZ be a real K×KK\times KK×K matrix that is invertible. Assume Zp∈SZp\in SZp∈S for every p∈Sp\in Sp∈S and Z−1p∈SZ^{-1}p\in SZ−1p∈S for every p∈Sp\in Sp∈S, where Z−1Z^{-1}Z−1 is the matrix inverse. Let p∈RKp\in\mathbb R^Kp∈RK be a pure state of SSS: p∈Sp\in Sp∈S, ppp is an extreme point of SSS, and p≠0p\neq0p=0. Then ZpZpZp is also a pure state of SSS: ZpZpZp is an extreme point of SSS and Zp≠0Zp\neq0Zp=0.

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