AFTD Auto-Formalizing Theoretical Domains

partition_A

def

The family A_n of partitions of n consists of those partitions of n whose multiset of parts contains {1, 2}, {1, 3}, {1, 4}, or {2, 3, 4}.

Statement

def partition_A (n : ℕ) : Finset (Nat.Partition n)
Defined in
arXiv:2610.01747, Section 6.1, Eq. (23)
Verified
27 Oct 2026
Axioms
none listed
Used by 3

Read back from the Lean

For any natural number n, partition_A n is defined as the finite set of all partitions p of n such that at least one of the following holds: 1. 1 ∈ p.parts and 2 ∈ p.parts 2. 1 ∈ p.parts and 3 ∈ p.parts 3. 1 ∈ p.parts and 4 ∈ p.parts 4. 2 ∈ p.parts and 3 ∈ p.parts and 4 ∈ p.parts

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 family A_n of integer partitions of n whose parts contain at least one member of H = {{1,2}, {1,3}, {1,4}, {2,3,4}}. -/
def partition_A (n : ℕ) : Finset (Nat.Partition n) := Finset.univ.filter fun p =>
    (1 ∈ p.parts ∧ 2 ∈ p.parts) ∨
    (1 ∈ p.parts ∧ 3 ∈ p.parts) ∨
    (1 ∈ p.parts ∧ 4 ∈ p.parts) ∨
    (2 ∈ p.parts ∧ 3 ∈ p.parts ∧ 4 ∈ p.parts)
See it in the graphDiscuss this resultChallenge it