Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Hardy's N2N^2N2 fiducial projectors are linearly independent

Proved
HardyFiveAxioms.fiducialProjector_card_linearIndependent

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

linear-algebramathematical-physicsquantum-foundationsquantum-information

For every NNN, there are exactly N2N^2N2 fiducial projectors

∣n⟩⟨n∣ (1≤n≤N),∣mn⟩x⟨mn∣, ∣mn⟩y⟨mn∣ (1≤m<n≤N),|n\rangle\langle n|\ (1\le n\le N),\qquad |mn\rangle_x\langle mn|,\ |mn\rangle_y\langle mn|\ (1\le m<n\le N),∣n⟩⟨n∣ (1≤n≤N),∣mn⟩x​⟨mn∣, ∣mn⟩y​⟨mn∣ (1≤m<n≤N),

and they are linearly independent over R\mathbb RR as elements of the space of complex N×NN\times NN×N matrices.

This is the claim of Section 5 that "this makes a total of N2N^2N2 projectors. It is clear that these projectors are linearly independent."

Formalization Note Linear independence is over R\mathbb RR, the field relevant to real combinations a⋅P^a\cdot\hat Pa⋅P^ of Hermitian operators. The count refers to the index type of the family in hardy2001_projectors.

Preamble
import Mathlib
import Definitions.Def_hardy2001_projectors
Formal statement
namespace HardyFiveAxioms

/-- Hardy 2001, Section 5 (Eqs. (26)–(27)): there are `N²` fiducial projectors
`|n⟩⟨n|`, `|mn⟩ₓ⟨mn|`, `|mn⟩_y⟨mn|`, and they are linearly independent over `ℝ`. -/
theorem fiducialProjector_card_linearIndependent (N : ℕ) :
    Fintype.card (FiducialIndex N) = N ^ 2 ∧
      LinearIndependent ℝ (fiducialProjector (N := N)) := 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. 8, Section 5, Eqs. (26)–(27) and the sentences following Eq. (27)
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.

For every natural number NNN, two things hold. First, the index set of the fiducial family (the disjoint union of {0,…,N−1}\{0,\dots,N-1\}{0,…,N−1} with two copies of the set of pairs (m,n)(m,n)(m,n), 0≤m<n≤N−10\le m<n\le N-10≤m<n≤N−1) has exactly N2N^2N2 elements. Second, the family fid\mathrm{fid}fid of complex N×NN\times NN×N matrices, consisting of proj(en)\mathrm{proj}(e_n)proj(en​), proj(12(em+en))\mathrm{proj}(\tfrac1{\sqrt2}(e_m+e_n))proj(2​1​(em​+en​)) and proj(12(em+ien))\mathrm{proj}(\tfrac1{\sqrt2}(e_m+ie_n))proj(2​1​(em​+ien​)) for m<nm<nm<n, is linearly independent over R\mathbb RR: a real linear combination of these matrices is the zero matrix only if all coefficients are 000. Here proj(v)jk=vjvk‾\mathrm{proj}(v)_{jk}=v_j\overline{v_k}proj(v)jk​=vj​vk​​.

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