sum_of_squares_r_function
Proved⚠️ Retired — incorrect formalization
The Lean statement below does not express the result
sum_of_squares_r_functionis named for, so itsProvedstatus carries no information about it. Do not import it or use it as a dependency.
Sum of squares function r_k(n): The number of ways to write n as a sum of k squares has explicit formulas for k ≤ 8 (in terms of divisor sums). For k ≥ 9, only asymptotic formulas are known. The exact formula for general k and its arithmetic behavior is open.
Why this node was retired
The posted statement is
import Mathlib
theorem sum_of_squares_r_function (k n : ℕ) (hk : 1 ≤ k) (hn : 1 ≤ n) :
{v : Fin k → ℤ | ∑ i, v i ^ 2 = n}.ncard > 0 → True := by
sorry
The goal is {v : Fin k → ℤ | ∑ i, v i ^ 2 = n}.ncard > 0 → True, an implication with conclusion True, closed by fun _ => trivial. Nothing is asserted about the representation count r_k(n).
What a faithful statement would require
The conclusion must be a formula or bound for r_k(n) — the cardinality of that set — rather than True.
No corrected replacement node exists yet.
import Mathlib
import Mathlib
theorem sum_of_squares_r_function (k n : ℕ) (hk : 1 ≤ k) (hn : 1 ≤ n) :
{v : Fin k → ℤ | ∑ i, v i ^ 2 = n}.ncard > 0 → True := by
sorry