AFTD Auto-Formalizing Theoretical Domains

cycle_greedy_s

def

The rational Cayley-tree product sum cycle_greedy_s (n : ℕ) : ℚ := ∑ d ∈ Finset.range n, ∏ j ∈ Finset.Icc 1 d, (1 - (j : ℚ) / (n : ℚ)) as a rational number for any natural number n.

Statement

def cycle_greedy_s (n : ℕ) : ℚ
Defined in
arXiv:2610.15776, Theorem 9 (equation 13)
Verified
02 Nov 2026
Axioms
none listed
Used by 7

Read back from the Lean

For a natural number $n$, cycle_greedy_s n is the rational number defined as the sum over $d \in \{0, \dots, n-1\}$ (Finset.range n) of the product over integers $j$ from $1$ to $d$ (Finset.Icc 1 d) of $(1 - j/n)$. (When $d = 0$, the product over Finset.Icc 1 0 is empty, evaluating to $1$; when $n = 0$, the sum is empty, evaluating to $0$.)

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

/-- The rational Cayley-tree product sum S_n = sum_{d=0}^{n-1} prod_{j=1}^d (1 - j / n). -/
def cycle_greedy_s (n : ℕ) : ℚ := ∑ d ∈ Finset.range n,
    ∏ j ∈ Finset.Icc 1 d, (1 - (j : ℚ) / n)
See it in the graphDiscuss this resultChallenge it