leading_unit_m
def
The unrounded completeness threshold M_{g,k} = (a_{g+k}^{(g)} + 1) / 2^g for positive integers g and k.
Statement
noncomputable def leading_unit_m (g k : ℕ) : ℚ
- Defined in
- arXiv:2611.10200, eq. (1.5)
- Verified
- 10 Nov 2026
- Axioms
- none listed
- Built on 1
- leading_unit_aThe coefficient a_m^{(g)} of z^m in the formal power series A_g(z) = ((1 - z)^2 Q_g(z))⁻¹.
Read back from the Lean
leading_unit_m is a definition taking two natural numbers $g$ and $k$ and returning the rational number
$$ \frac{\text{leading\_unit\_a}(g, g + k) + 1}{2^g} $$
where $\text{leading\_unit\_a}(g, g + k)$ is the coefficient of $X^{g + k}$ in the power series $\text{leading\_unit\_ag}(g)$.
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 unrounded completeness threshold M_{g,k} = (a_{g+k}^{(g)} + 1) / 2^g. -/ noncomputable def leading_unit_m (g k : ℕ) : ℚ := (leading_unit_a g (g + k) + 1) / (2 : ℚ) ^ g