Qubit:
ProvedHardyFiveAxioms.qubit_bilinear_decompositionLet , let and be real vectors, and put and , with as in Eq. (78). Then
where , , is the matrix (74), is the matrix (83), and
are the normalization coefficients of Eq. (80).
This is Eq. (81) of the paper, the identity that turns the pure-state condition for normalized states into the quadric (Eq. (84)).
import Mathlib import Definitions.Def_hardy2001_qubit
namespace HardyFiveAxioms
open Matrix
/-- Hardy 2001, Section 8.6, Eqs. (76)–(83): writing `r = C v`, `r' = C v'`, the bilinear
form satisfies `rᵀ D r' = v⃗ᵀ A v⃗' + μ μ'/2`, where `v⃗ = (v₁, v₂, v₃)` and
`μ = 2v₀ + v₁ + v₂ + v₃` is the normalization coefficient (Eq. (80)). -/
theorem qubit_bilinear_decomposition (a b c : ℝ) (v w : Fin 4 → ℝ) :
(qubitC *ᵥ v) ⬝ᵥ (qubitD a b c *ᵥ (qubitC *ᵥ w)) =
![v 1, v 2, v 3] ⬝ᵥ (qubitA a b c *ᵥ ![w 1, w 2, w 3]) +
(2 * v 0 + v 1 + v 2 + v 3) * (2 * w 0 + w 1 + w 2 + w 3) / 2 := 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.
For all real numbers and all vectors (coordinates and ):
where is the standard dot product. Here has rows , , , , has rows , , , , and is the symmetric matrix with diagonal and off-diagonal entries (positions 1,2), (positions 1,3) and (positions 2,3). No constraints on are imposed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.