AFTD Auto-Formalizing Theoretical Domains

cycle_greedy_s_two

theoremverified

The rational Cayley product sum evaluates to 3/2 at n = 2: cycle_greedy_s 2 = 3 / 2.

Statement

theorem cycle_greedy_s_two : cycle_greedy_s 2 = 3 / 2
Source
arXiv:2610.15776, Theorem 9
Verified
04 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
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 : ℚ))…
Used by 1

Read back from the Lean

cycle_greedy_s 2 is equal to 3/2 (evaluated 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 identity is proved by directly calculating the finite sum defining cycle_greedy_s at n = 2. Unfolding the definition leaves a sum of two terms: an empty product equal to 1 for d = 0, and a single factor 1 - 1/2 = 1/2 for d = 1. The numerical evaluation tactic norm_num expands the sum and product ranges using their recurrence lemmas to compute 1 + 1/2 = 3/2.

  1. Express cycle_greedy_s 2 explicitly as a finite sum of products

    Unfolding the definition of cycle_greedy_s replaces cycle_greedy_s 2 with the explicit sum over d ∈ range 2 of the product over j ∈ [1, d] of (1 - j/2).

    line 3

      unfold cycle_greedy_s
  2. The sum evaluates to 3/2 automation

    For d = 0, the interval [1, 0] is empty, so the product is 1. For d = 1, the interval is [1, 1], giving the single factor 1 - 1/2 = 1/2. Summing these yields 1 + 1/2 = 3/2. The norm_num tactic computes this arithmetic automatically by expanding the finite sum with Finset.sum_range_succ and the interval product with Finset.prod_Icc_succ_top.

    line 4

    uses Finset.sum_range_succ, Finset.prod_Icc_succ_top

      norm_num [Finset.sum_range_succ, Finset.prod_Icc_succ_top]
Finset.sum_range_succ
The sum of a function over the range of indices {0, ..., n} equals the sum over {0, ..., n - 1} plus the term at index n.
Finset.prod_Icc_succ_top
The product of a function over the integer interval [a, b + 1] equals the product over [a, b] multiplied by the factor at b + 1, provided a ≤ b + 1.

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 Cayley product sum S_2 = 3/2. -/theorem cycle_greedy_s_two : cycle_greedy_s 2 = 3 / 2 := by  unfold cycle_greedy_s  norm_num [Finset.sum_range_succ, Finset.prod_Icc_succ_top]
See it in the graphDiscuss this resultChallenge it