Lemma 2.7 — spectral norm of the full character matrix
ProvedPauliUnclonable531.Pauli.character_normcryptographyp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-information
For every n≥0, form the full matrix Ξ with rows and columns indexed by all pairs of n-bit strings and entries Ξₖ,ₗ=(−1)^[k,l]. Its Euclidean operator norm is exactly
This is the full 4ⁿ-square matrix, including its identity row and column. The norm statement is unchanged at n=0, when Ξ is the one-entry matrix [1].
Differences from the source:
- encoding: finite-dimensional complex Hilbert-space operators and binary strings → complex matrices indexed by finite computational bases, Fin 2 bits, real Born probabilities, Euclidean spectral norm and PSD-difference order; reason: these are the same finite-dimensional objects and conventions after choosing the source basis
Preamble
import Mathlib import Definitions.Def_PauliUnclonable531_Pauli_Symplectic open scoped Matrix Matrix.Norms.L2Operator ComplexOrder set_option autoImplicit false
Formal statement
namespace PauliUnclonable531.Pauli /-- Lemma 2.7, p.13, on the full 4^n-square matrix, also at n=0. -/ theorem character_norm (n : ℕ) : spectralNorm (character n) = (2 : ℝ)^n := by sorry end PauliUnclonable531.Pauli
Source
Prabhanjan Ananth, Seyoon Ragavan, Amit Sahai, STOC 2027 submission #531 (October 2026), Lemma 2.7, p.13
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.