Lemma 4: pure-state epsilon net
OpenQAlgorithms.Papers.Independent.Intakenext100.P54.pure_state_epsilon_netLet and . There is a finite set of normalized vectors in with such that every normalized vector has some satisfying
The first norm acts on the difference of rank-one density operators; the last norm acts on vectors. Fidelity is squared Uhlmann fidelity. This single net controls both distances, preserving the entire chain in the source.
Formalization Note The small-error restriction corrects the printed positive-error domain, as explained in HARD.md.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P54
noncomputable section
open scoped BigOperators Matrix ComplexConjugate ComplexOrder NNReal ENNReal
open MeasureTheory ProbabilityTheory
namespace QAlgorithms.Papers.Independent.Intakenext100.P54
open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)
open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)
open QAlgorithms.Papers.Independent.Dependency50.P07 (wordProb)
open QAlgorithms.Papers.Independent.Claimed50.P08 (classicalEntropy)
open QAlgorithms.Papers.Independent.Claimed50.P38 (tensorSuperop)
/-- Lemma 4, PDF pp.3,15. Correct the printed eps > 0 to the proof's 0 < eps ≤ 1;
for eps > 5 the printed cardinality upper bound is smaller than one.
The entire density/vector distance chain is retained. -/
theorem pure_state_epsilon_net (D : ℕ) (hD : 0 < D)
(eps : ℝ) (heps : 0 < eps) (hepsOne : eps ≤ 1) :
∃ M : Finset (RSPVector (Fin D)), (M.card : ℝ) ≤ (5 / eps) ^ (2 * D) ∧
∀ phi : RSPVector (Fin D), ∃ psi ∈ M,
traceNorm (pureDensity phi.val - pureDensity psi.val) ≤
2 * Real.sqrt (1 - fidelity (pureDensity phi.val) (pureDensity psi.val)) ∧
2 * Real.sqrt (1 - fidelity (pureDensity phi.val) (pureDensity psi.val)) ≤
2 * ‖phi.val - psi.val‖ ∧ 2 * ‖phi.val - psi.val‖ ≤ eps := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P54
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number and every real , there exists a finite set of unit vectors in , of cardinality
such that for every unit vector , some satisfies all three inequalities
Here , the matrix trace norm is , and
The set consists of actual unit vectors, so the final distance compares the vectors themselves, including their phases. The assertion includes and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.