two_sided_shadow_optimal_score_three
Sanity check: the optimal shadow score on 3 qubits equals 99.
Statement
theorem two_sided_shadow_optimal_score_three : two_sided_shadow_optimal_score 3 = 99- Source
- scout/2610-04621-exact-clifford-optimality-for-two-sided-locally-randomized.md:378
- Verified
- 31 Oct 2026
- Axioms
propext- Built on 1
- two_sided_shadow_optimal_scoreThe optimal score s_k for a k-qubit Clifford unitary in the two-sided locally randomized classical shadow architecture, defined as a…
Read back from the Lean
two_sided_shadow_optimal_score 3 is equal to 99 (in the natural numbers).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The theorem is verified by direct calculation using the definition of `two_sided_shadow_optimal_score`. For $k = 3$, the definition evaluates to $(3 \cdot 5^3 + 3^3 - 6) / 4 = 396 / 4 = 99$. Since both sides reduce to the same natural number, the result holds reflexively by definition.
The optimal shadow score on 3 qubits is 99.
By definition, evaluating `two_sided_shadow_optimal_score 3` takes the odd branch since $3 \pmod 2 = 1$, giving $(3 \cdot 5^3 + 3^3 - 6) / 4 = (3 \cdot 125 + 27 - 6) / 4 = 396 / 4 = 99$. Since both sides evaluate to the same value, the equality holds by reflexivity (`rfl`).
theorem two_sided_shadow_optimal_score_three : two_sided_shadow_optimal_score 3 = 99 := rfl
Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
/-- Sanity check: the optimal shadow score on 3 qubits equals 99. -/theorem two_sided_shadow_optimal_score_three : two_sided_shadow_optimal_score 3 = 99 := rfl