AFTD Auto-Formalizing Theoretical Domains

OneLayeredFamily

structure

Given 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 of a positive number k of layers (k : ℕ with 0 < k) indexed by Fin k, where each layer layers t is a nonempty finite set of r-element subsets of V (Finset (Finset V)), the layers are pairwise disjoint (for all t₁ ≠ t₂, layers t₁ and layers t₂ are disjoint), and for every nonempty finite subset S of V (S : Finset V with S.Nonempty), the set of indices t : Fin k for which some member of layers t contains S is order-connected (Set.OrdConnected in Fin k).

Statement

structure OneLayeredFamily (V : Type*) (r : ℕ) where
  k : ℕ
  k_pos : 0 < k
  layers : Fin k → Finset (Finset V)
  layers_nonempty : ∀ t, (layers t).Nonempty
  layers_card : ∀ t, ∀ F ∈ layers t, F.card = r
  layers_disjoint : ∀ t₁ t₂, t₁ ≠ t₂ → Disjoint (layers t₁) (layers t₂)
  interval_property : ∀ S : Finset V, S.Nonempty →
    ({t : Fin k | ∃ F ∈ layers t, S ⊆ F} : Set (Fin k)).OrdConnected
Defined in
arXiv:2611.08071 Section 2
Verified
06 Nov 2026
Axioms
none listed
Built on 2
  • TotalPreorderA total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or…
  • LinearOrder.toTotalPreorderEvery LinearOrder is a TotalPreorder.
Used by 5
  • 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_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_layersFor 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…
  • 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

OneLayeredFamily is a structure parameterized by an arbitrary type V and a natural number r, bundling: 1. k : ℕ: a natural number representing the number of layers, 2. k_pos : 0 < k: a proof that $k$ is strictly positive ($k \ge 1$), 3. layers : Fin k → Finset (Finset V): a sequence of $k$ layers (indexed by $t \in \text{Fin } k$), each being a finite collection of finite subsets of $V$, 4. layers_nonempty : ∀ t, (layers t).Nonempty: each layer is nonempty (contains at least one subset of $V$), 5. layers_card : ∀ t, ∀ F ∈ layers t, F.card = r: every element $F$ in every layer has cardinality exactly $r$ ($r$-uniformity), 6. layers_disjoint : ∀ t₁ t₂, t₁ ≠ t₂ → Disjoint (layers t₁) (layers t₂): distinct layers are pairwise disjoint (no subset of $V$ belongs to more than one layer), 7. interval_property : ∀ S : Finset V, S.Nonempty → ({t : Fin k | ∃ F ∈ layers t, S ⊆ F} : Set (Fin k)).OrdConnected: for every nonempty finite subset $S \subseteq V$, the set of layer indices $t \in \text{Fin } k$ such that some $F \in \text{layers } t$ contains $S$ is order-connected in $\text{Fin } k$ (i.e., an interval: if $t_1 \le t_2 \le t_3$ and $S$ is contained in some member of layer $t_1$ and some member of layer $t_3$, then $S$ is also contained in some member of layer $t_2$).

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

/-- A 1-layered family of r-subsets on a vertex type V partitioned into nonempty layers satisfying the interval property. -/
structure OneLayeredFamily (V : Type*) (r : ℕ) where
  k : ℕ
  k_pos : 0 < k
  layers : Fin k → Finset (Finset V)
  layers_nonempty : ∀ t, (layers t).Nonempty
  layers_card : ∀ t, ∀ F ∈ layers t, F.card = r
  layers_disjoint : ∀ t₁ t₂, t₁ ≠ t₂ → Disjoint (layers t₁) (layers t₂)
  interval_property : ∀ S : Finset V, S.Nonempty →
    ({t : Fin k | ∃ F ∈ layers t, S ⊆ F} : Set (Fin k)).OrdConnected
See it in the graphDiscuss this resultChallenge it