AFTD Auto-Formalizing Theoretical Domains

star_core_exponent

def

For a star-core graph with k vertices, center block size b, and leaf block sizes a_1, ..., a_{k-1} summing to Q = b + sum_i a_i, the assignment sum exponent X_n(b, a) at replica order n is defined by sum_i n^(Q - a_i) + prod_i (n^(a_i) - n + 1).

Statement

def star_core_exponent (k : ℕ) (n : ℕ) (b : ℕ) (a : Fin (k - 1) → ℕ) : ℕ
Defined in
arXiv:2610.26814, Theorem 3.1 and Eq. (46)
Verified
14 Nov 2026
Axioms
none listed

Read back from the Lean

The function star_core_exponent takes natural numbers k, n, b, and a sequence of natural numbers a : Fin (k - 1) → ℕ. It returns the natural number given by: (∑_{i : Fin (k - 1)} n^(Q - a i)) + ∏_{i : Fin (k - 1)} (n^(a i) - n + 1) where Q = b + ∑_{i : Fin (k - 1)} a i, and all operations (addition, subtraction, exponentiation) are computed in ℕ.

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 assignment sum exponent X_n for a star-core graph with center b and leaves a_1, ..., a_{k-1}. -/
def star_core_exponent (k : ℕ) (n : ℕ) (b : ℕ) (a : Fin (k - 1) → ℕ) : ℕ :=
  let Q := b + ∑ i, a i
  (∑ i, n ^ (Q - a i)) + ∏ i, (n ^ a i - n + 1)
See it in the graphDiscuss this resultChallenge it