Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Ridge-closed connected layer families

Definition
Hirsch_clf_ridge_closed

by elmismisimoxhunca · Sep 13, 2026 · Mathlib c5ea003 (Lean v4.30.0)

combinatoricsconnected-layer-familieshirsch-conjecture

A layer of a connected layer family (definition Hirsch_clf) is ridge-closed if it contains every ddd-set all of whose (d−1)(d-1)(d−1)-subsets lie in some base of that layer; equivalently, the layer is determined by its ridge shadow Σt={R:∣R∣=d−1, R⊆B for some B∈Lt}\Sigma_t=\{R:|R|=d-1,\ R\subseteq B\text{ for some }B\in\mathcal L_t\}Σt​={R:∣R∣=d−1, R⊆B for some B∈Lt​} as Lt={B:(Bd−1)⊆Σt}\mathcal L_t=\{B:\binom{B}{d-1}\subseteq\Sigma_t\}Lt​={B:(d−1B​)⊆Σt​}.

Two facts make this the natural class for the polynomial-length question of the Eisenbrand--Hähnle--Razborov--Rothvoß abstraction: every family reduces to a ridge-closed one with loss factor n−d+1n-d+1n−d+1 (Hirsch.clf_reduces_to_ridge_closed), and conversely every family is exactly the link of one symbol in a ridge-closed family of one higher rank with the same height (Hirsch.clf_cone_ridge_closed_embedding). So polynomial length for ridge-closed families is equivalent, with the same exponent, to polynomial length for all families.

Formalization Note The predicate quantifies over all layers and all ddd-sets of the symbol type; ridges are the (d−1)(d-1)(d−1)-subsets of the candidate base.

Definition code
import Mathlib
import Definitions.Def_Hirsch_clf

/-!
# Ridge-closed connected layer families

A layer of a connected layer family is **ridge-closed** if it contains every `d`-set all of
whose `(d-1)`-subsets ("ridges") lie in some base of that layer; equivalently the layer is
determined by its ridge shadow.  Every connected layer family reduces to a ridge-closed one
with polynomial loss (`Hirsch.clf_reduces_to_ridge_closed`), and conversely arbitrary
families are exactly the links of one symbol in ridge-closed families
(`Hirsch.clf_cone_ridge_closed_embedding`), so the polynomial-length question for the
Eisenbrand–Hähnle–Razborov–Rothvoß abstraction is equivalent to the same question for
ridge-closed families.
-/

namespace Hirsch

/-- Every layer of `F` contains every `d`-set all of whose `(d-1)`-subsets lie in some base
of that layer. -/
def CLF.RidgeClosed {V : Type*} [DecidableEq V] [Fintype V] {d : ℕ} (F : CLF V d) : Prop :=
  ∀ t, ∀ B : Finset V, B.card = d →
    (∀ R ⊆ B, R.card = d - 1 → ∃ B' ∈ F.layer t, R ⊆ B') → B ∈ F.layer t

end Hirsch
Source
Campaign research notes (2026-09-13), plans/clf_reduce.md Definition 4 and plans/rc_charge.md Section 2; F. Eisenbrand, N. Hähnle, A. Razborov, T. Rothvoß, Math. Oper. Res. 35 (2010)

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me