AFTD Auto-Formalizing Theoretical Domains

partition_number_neg

theoremverified

For any integer m such that m < 0, the integer-valued partition function partition_number m equals 0.

Statement

theorem partition_number_neg (m : ℤ) (hm : m < 0) : partition_number m = 0
Source
arXiv:2610.01747 Section 6.1
Verified
28 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • partition_numberThe function partition_number maps an integer m : ℤ to an integer in ℤ: if 0 ≤ m, it returns the cardinality Nat.card of the type of…

Read back from the Lean

For every integer $m$, if $m < 0$, then $\operatorname{partition\_number}(m) = 0$.

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 theorem states that the partition function evaluates to 0 for any strictly negative integer $m$. By definition, $\operatorname{partition\_number}(m)$ is given by a case distinction that returns 0 whenever $0 \le m$ is false. Since $m < 0$, the condition $0 \le m$ is refuted, and simplifying the definition immediately gives 0.

  1. $\operatorname{partition\_number}(m) = 0$

    By definition, $\operatorname{partition\_number}(m)$ is given by the conditional $\text{if } 0 \le m \text{ then } \dots \text{ else } 0$. Applying `not_le.mpr` to the assumption $m < 0$ shows that $\neg(0 \le m)$, so the condition fails and the conditional simplifies directly to $0$.

    line 3

    uses not_le.mpr

      simp [partition_number, not_le.mpr hm]
not_le.mpr
If $b < a$, then it is not the case that $a \le b$.

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

/-- The partition function at negative integers equals 0. -/theorem partition_number_neg (m : ℤ) (hm : m < 0) : partition_number m = 0 := by  simp [partition_number, not_le.mpr hm]
See it in the graphDiscuss this resultChallenge it