AFTD Auto-Formalizing Theoretical Domains

restricted_base_ell_partition_zero

theoremverified

For any natural numbers $k$ and $\ell$, the restricted base-$\ell$ partition function evaluated at 0 is 1.

Statement

theorem restricted_base_ell_partition_zero (k ℓ : ℕ) :
    restricted_base_ell_partition k ℓ 0 = 1
Source
arXiv:2611.08109 Section 1
Verified
07 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • restricted_base_ell_partitionFor integers k, ℓ, and n, the restricted base-ℓ partition function b_{k,ℓ}(n) is the number of partitions of n into powers of ℓ where each…

Read back from the Lean

For all natural numbers $k$ and $\ell$, restricted_base_ell_partition k ℓ 0 = 1.

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 restricted base-$\ell$ partition function at $0$ counts partitions of $0$ whose parts are powers of $\ell$ and appear at most $k$ times. Since the only partition of $0$ is the empty partition, which has no parts, all restrictions on the parts are vacuously satisfied. Consequently, the set of such partitions is the singleton containing only the empty partition, which has cardinality $1$.

  1. restricted_base_ell_partition k ℓ 0 = 1 automation

    Unfold the definitions of the restricted base-$\ell$ partition function, the predicate-restricted partitions, and the count-restricted partitions. There is exactly one partition of $0$, which has no parts. The conditions that every part is a power of $\ell$ and occurs at most $k$ times are vacuously satisfied by this empty partition. The set of valid partitions is therefore a singleton, whose cardinality is $1$.

    line 4

    uses restricted_base_ell_partition, Nat.Partition.restricted, Nat.Partition.countRestricted

      simp [restricted_base_ell_partition, Nat.Partition.restricted, Nat.Partition.countRestricted]
restricted_base_ell_partition
the number of partitions of $n$ whose parts are all powers of $\ell$ and each appear at most $k$ times (with multiplicity strictly less than $k + 1$)
Nat.Partition.restricted
the finite set of partitions of $n$ whose parts all satisfy the predicate $p$
Nat.Partition.countRestricted
the finite set of partitions of $n$ where each part appears with multiplicity strictly less than $m$

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 restricted base-ℓ partition function at 0 is 1. -/theorem restricted_base_ell_partition_zero (k ℓ : ℕ) :    restricted_base_ell_partition k ℓ 0 = 1 := by  simp [restricted_base_ell_partition, Nat.Partition.restricted, Nat.Partition.countRestricted]
See it in the graphDiscuss this resultChallenge it