cycle_greedy_second_moment_formula
def
The conjectured rational closed-form second moment formula cycle_greedy_second_moment_formula (n : ℕ) : ℚ := ((n : ℚ) ^ 2 / 48) * (5 * (n : ℚ) + 1 - 2 * cycle_greedy_s n) for greedy online cycle assignment.
Statement
def cycle_greedy_second_moment_formula (n : ℕ) : ℚ- Defined in
- OP-890
- Verified
- 02 Nov 2026
- Axioms
- none listed
- Built on 1
- cycle_greedy_sThe rational Cayley-tree product sum
cycle_greedy_s (n : ℕ) : ℚ := ∑ d ∈ Finset.range n, ∏ j ∈ Finset.Icc 1 d, (1 - (j : ℚ) / (n : ℚ))…
- cycle_greedy_sThe rational Cayley-tree product sum
- Used by 4
- cycle_greedy_second_moment_formula_eq_mean_formFor every natural number n,…
- cycle_greedy_second_moment_twoFor n = 2, the exact rational second moment equals the conjectured formula value:…
- cycle_greedy_second_moment_threeFor n = 3, the exact rational second moment equals the conjectured formula value:…
- cycle_greedy_second_moment_formula_twoThe closed-form second moment formula evaluates to 2/3 at n = 2:
cycle_greedy_second_moment_formula 2 = 2 / 3.
Read back from the Lean
The declaration defines a function cycle_greedy_second_moment_formula taking a natural number n and returning the rational number ((n : ℚ)^2 / 48) * (5 * (n : ℚ) + 1 - 2 * cycle_greedy_s n).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- Conjectured closed-form formula for the exact second moment of cycle greedy assignment. -/ def cycle_greedy_second_moment_formula (n : ℕ) : ℚ := ((n : ℚ) ^ 2 / 48) * (5 * (n : ℚ) + 1 - 2 * cycle_greedy_s n)