AFTD Auto-Formalizing Theoretical Domains

one_layered_max_layers

def

For natural numbers m and r, one_layered_max_layers m r is the supremum (maximum) over all n ≤ m and all 1-layered families of r-subsets on Fin n of the number of layers k, which is 0 if no such family exists (in particular when m < r).

Statement

noncomputable def one_layered_max_layers (m r : ℕ) : ℕ
Defined in
arXiv:2611.08071 Section 2
Verified
06 Nov 2026
Axioms
none listed
Built on 1
  • OneLayeredFamilyGiven a type V and a natural number r, a 1-layered family of r-subsets on V is a structure OneLayeredFamily (V : Type*) (r : ℕ) consisting…
Used by 6
  • one_layered_family_upper_boundsFor all integers r ≥ 1 and m ≥ r, the maximum number of layers F(m, r) of a 1-layered family of r-subsets on at most m vertices satisfies…
  • one_layered_recurrenceFor integers r ≥ 2 and m ≥ r, the maximum number of layers F(m, r) satisfies F(m, r) ≤ F(⌊(m - 1) / 2⌋, r) + F(⌈(m - 1) / 2⌉, r) + F(m -…
  • one_layered_max_layers_one_leFor any positive integer m, the maximum number of layers in a 1-layered family of 1-subsets on at most m vertices is at most m.
  • one_layered_linear_boundFor all integers r ≥ 1 and m ≥ r, the maximum number of layers F(m, r) in a 1-layered family of r-subsets on at most m vertices satisfies…
  • one_layered_max_layers_of_ltIf m < r, then F(m, r) = 0, as no 1-layered family of r-subsets can be formed on at most m vertices.
  • one_layered_binomial_boundFor all integers r ≥ 1 and m ≥ r, the maximum number of layers F(m, r) in a 1-layered family of r-subsets on at most m vertices satisfies…

Read back from the Lean

one_layered_max_layers m r is defined as the supremum (sSup in ℕ) of the set of all natural numbers k such that there exists a natural number n ≤ m and a OneLayeredFamily (Fin n) r whose number of layers F.k equals k.

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 maximum number of layers F(m, r) in a 1-layered family of r-subsets using at most m vertices, defined as 0 when m < r. -/
noncomputable def one_layered_max_layers (m r : ℕ) : ℕ := sSup {k : ℕ | ∃ n ≤ m, ∃ (F : OneLayeredFamily (Fin n) r), F.k = k}
See it in the graphDiscuss this resultChallenge it