Proof of `Tunnell's representation counts are even`

groundedproofs/Lax712553Proofs/TunnellParity.lean · lax-712553

What this proof establishes

no assumptions

thm✓Lax712553.TunnellParity

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

The map $(x, y, z) ↦ (x, −y, z)$ preserves the equation and the bounds; a fixed point has $y = 0$ , so $n = a x² + c z²$ would be even.