AFTD Auto-Formalizing Theoretical Domains

cycle_greedy_second_moment_formula_two

theoremverified

The closed-form second moment formula evaluates to 2/3 at n = 2: cycle_greedy_second_moment_formula 2 = 2 / 3.

Statement

theorem cycle_greedy_second_moment_formula_two : cycle_greedy_second_moment_formula 2 = 2 / 3
Source
OP-890
Verified
04 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • cycle_greedy_second_moment_formulaThe conjectured rational closed-form second moment formula…
  • cycle_greedy_s_twoThe rational Cayley product sum evaluates to 3/2 at n = 2: cycle_greedy_s 2 = 3 / 2.
  • cycle_greedy_sThe rational Cayley-tree product sum cycle_greedy_s (n : ℕ) : ℚ := ∑ d ∈ Finset.range n, ∏ j ∈ Finset.Icc 1 d, (1 - (j : ℚ) / (n : ℚ))…

Read back from the Lean

The value of cycle_greedy_second_moment_formula evaluated at 2 is equal to 2 / 3 (in the rational 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 proof unfolds the definition of `cycle_greedy_second_moment_formula` at n = 2, substitutes the precomputed value `cycle_greedy_s 2 = 3 / 2`, and evaluates the resulting rational arithmetic to obtain 2 / 3.

  1. The equation reduces to the numerical identity (2^2 / 48) * (5 * 2 + 1 - 2 * (3 / 2)) = 2 / 3.

    Unfolding the definition of `cycle_greedy_second_moment_formula` at n = 2 gives (2^2 / 48) * (5 * 2 + 1 - 2 * cycle_greedy_s 2) = 2 / 3. Rewriting with `cycle_greedy_s_two` replaces `cycle_greedy_s 2` with 3 / 2.

    lines 3–4

    uses cycle_greedy_s_two

      unfold cycle_greedy_second_moment_formula
      rw [cycle_greedy_s_two]
  2. The numerical equality holds.

    Direct computation with rational numbers evaluates (4 / 48) * (11 - 3) = (1 / 12) * 8 = 2 / 3, which completes the proof.

    line 5

      norm_num
cycle_greedy_s_two
The sum `cycle_greedy_s` evaluates to 3/2 at n = 2.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- Evaluation of the closed second moment formula at n = 2 gives 2/3. -/theorem cycle_greedy_second_moment_formula_two : cycle_greedy_second_moment_formula 2 = 2 / 3 := by  unfold cycle_greedy_second_moment_formula  rw [cycle_greedy_s_two]  norm_num
See it in the graphDiscuss this resultChallenge it