codegree_extremal_number
def
For a natural number n and a hypergraph F on vertex type W, the real-valued codegree extremal number codegree_extremal_number n F is the supremum in ℝ over all hypergraphs H on Fin n satisfying is_three_uniform H and is_hypergraph_free H F of min_pair_codegree n H cast to ℝ.
Statement
noncomputable def codegree_extremal_number (n : ℕ) {W : Type*} (F : Finset (Finset W)) : ℝ
- Defined in
- arXiv:2611.12582 Section 1
- Verified
- 13 Nov 2026
- Axioms
- none listed
- Built on 3
- is_three_uniformA hypergraph F (a finite family of finite sets of vertices) is 3-uniform if every hyperedge e in F has cardinality 3.
- is_hypergraph_freeA hypergraph H on vertex set Fin n is F-free if there does not exist an embedding f : W ↪ Fin n such that every hyperedge e in F maps…
- min_pair_codegreeThe minimum pair-codegree δ₂(H) of a 3-uniform hypergraph H on Fin n is the minimum of the pair-codegree over all pairs of distinct…
Read back from the Lean
codegree_extremal_number n F defines, for a natural number n, an implicit type W, and a hypergraph F : Finset (Finset W), the supremum (in ℝ) over all 3-uniform hypergraphs H on vertex set Fin n that are F-free, of the minimum pair codegree of H (cast to ℝ).
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 real-valued codegree extremal number ex₂(n, F) is the supremum in ℝ of δ₂(H) over all 3-uniform F-free hypergraphs H on Fin n. -/ noncomputable def codegree_extremal_number (n : ℕ) {W : Type*} (F : Finset (Finset W)) : ℝ := open Classical in ⨆ (H : Finset (Finset (Fin n))) (_h_unif : is_three_uniform H) (_h_free : is_hypergraph_free H F), (min_pair_codegree n H : ℝ)