AFTD Auto-Formalizing Theoretical Domains

designated_odd_partition_character_odd

theoremverified

For any odd part size i and multiplicity c, the designated odd partition character equals c.

Statement

theorem designated_odd_partition_character_odd (i c : ℕ) (h : Odd i) :
    designated_odd_partition_character i c = c
Source
arXiv:2611.05623, Section 2
Verified
06 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1

Read back from the Lean

For all natural numbers $i$ and $c$, if $i$ is odd, then $\text{designated\_odd\_partition\_character}(i, c) = c$.

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 for any odd part size i with multiplicity c, the designated odd partition character evaluates to c. The proof unfolds the definition of designated_odd_partition_character, which is defined by cases on whether i is odd, and simplifies using the hypothesis that i is odd.

  1. designated_odd_partition_character i c = c

    By definition, designated_odd_partition_character i c is defined as if Odd i then c else 0. Using the hypothesis h that i is odd, the conditional reduces directly to c.

    line 4

      simp [designated_odd_partition_character, h]

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

/-- Character on odd part sizes equals multiplicity. -/theorem designated_odd_partition_character_odd (i c : ℕ) (h : Odd i) :    designated_odd_partition_character i c = c := by  simp [designated_odd_partition_character, h]
See it in the graphDiscuss this resultChallenge it