For the prime is a quadratic nonresidue modulo
ProvedOddPerfectNumber.Kernel.three_is_quadratic_nonresidue_mod_euler_primeIf is a prime with and , equivalently , then is a quadratic nonresidue modulo .
By quadratic reciprocity, since the symbol is symmetric, so . Euler's criterion gives , because .
Consequence for the two-prime residual. The proved theorem
sigma_source_of_p_is_fourth_power_residue says that any prime supplying in the second Dris equation satisfies in , so is in particular a quadratic residue modulo . Taking contradicts this theorem, and therefore
This matters because the first Dris equation forces in the normalised two-prime branch, so without this exclusion the prime would look like a candidate supplier of the -part of . It removes the prime from the incoming -valuation budget entirely, without ever claiming that .
Preamble
import Mathlib
Formal statement
namespace OddPerfectNumber.Kernel
/-- When `p` is prime with `p % 4 = 1` and `p % 3 = 2`, the Legendre symbol
`legendreSym p 3` is `-1`: the prime `3` is a quadratic nonresidue modulo `p`.
Quadratic reciprocity with `p = 1 (mod 4)` makes the symbol symmetric, and
`p = 2 (mod 3)` evaluates `legendreSym p 3` as `-1`. -/
theorem three_is_quadratic_nonresidue_mod_euler_prime {p : Nat} [Fact p.Prime]
(hp4 : p % 4 = 1) (hp3 : p % 3 = 2) :
legendreSym p 3 = -1 := by
sorry
end OddPerfectNumber.Kernel