Eigensystem of the all-ones matrix: eigenvalues
ProvedPfisterCEP.allOnes_eigensystemgraph-statesheisenberg-picturep2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1quantum-opticssqueezing
Let be the real matrix with every entry equal to , and the standard basis vectors. Then
- ;
- for all ;
- the characteristic polynomial of is .
So the eigenvalues of , with multiplicity, are , with eigenvector for and the vectors (the "same respective eigenvectors" as for the GHZ adjacency matrix) for . The eigenvalue on is the squeezing enhancement factor of the phase sum.
Differences from the source:
- generalization: the eigenvectors → for all ; reason: the page's vectors are , special cases
- encoding: eigenvalues → ; reason: the characteristic polynomial records the eigenvalue multiset; at truncated subtraction gives , the characteristic polynomial of the empty matrix
Preamble
import Mathlib
Formal statement
namespace PfisterCEP
/-- **Eigensystem of the all-ones matrix: eigenvalues `{N, 0, …, 0}`.**
O. Pfister, *Graph states and carrier-envelope phase squeezing*, arXiv:quant-ph/0701104v2, Sec. b, p.2, right column: "The adjacency matrix has all its elements equal to 1 and has
eigenvalues {N, 0, · · · , 0} with the same respective eigenvectors."
With `J` the `N × N` real matrix of ones:
1. `J (1, …, 1) = N (1, …, 1)`;
2. `J (eₖ − eₗ) = 0` for all `k, l` (this contains the vectors `(1, −1, 0, …, 0)`, …,
`(1, 0, …, 0, −1)` of the GHZ paragraph);
3. the characteristic polynomial of `J` is `X^N − N X^{N−1}`, i.e. the eigenvalue multiset is
`{N, 0, …, 0}`.
**Formalization Note** At `N = 0` Lean's truncated `N − 1 = 0` makes clause 3 read `1 = X⁰ − 0·X⁰`,
which is the characteristic polynomial `1` of the empty matrix. -/
theorem allOnes_eigensystem (N : ℕ) : Matrix.mulVec (Matrix.of fun _ _ => (1 : ℝ) : Matrix (Fin N) (Fin N) ℝ) (fun _ => 1) = (N : ℝ) • (fun _ => (1 : ℝ)) ∧ (∀ k l : Fin N, Matrix.mulVec (Matrix.of fun _ _ => (1 : ℝ) : Matrix (Fin N) (Fin N) ℝ) (Pi.single k 1 - Pi.single l 1) = 0) ∧ (Matrix.of fun _ _ => (1 : ℝ) : Matrix (Fin N) (Fin N) ℝ).charpoly = Polynomial.X ^ N - Polynomial.C (N : ℝ) * Polynomial.X ^ (N - 1) := by sorry
end PfisterCEP
Source
Pfister, Graph states and carrier-envelope phase squeezing, arXiv:quant-ph/0701104v2, Sec. b, p.2, right column
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.