Reversible transformations send pure states to pure states
ProvedHardyFiveAxioms.reversible_maps_pure_to_pureLet be a set of states and let be an invertible real matrix such that both and map into itself (a reversible transformation). If is a pure state of , i.e. an extremal point of other than , then
Formalization Note " exists and is in " is encoded as invertibility of together with . Pure states are as in the definition file hardy2001_states.
import Mathlib import Definitions.Def_hardy2001_states
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
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 , let be any set (no convexity assumed), and let be a real matrix that is invertible. Assume for every and for every , where is the matrix inverse. Let be a pure state of : , is an extreme point of , and . Then is also a pure state of : is an extreme point of and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.