min_pair_codegree
def
The 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 vertices in Fin n (or 0 if n < 2).
Statement
noncomputable def min_pair_codegree (n : ℕ) (H : Finset (Finset (Fin n))) : ℕ
- Defined in
- arXiv:2611.12582 Section 1
- Verified
- 13 Nov 2026
- Axioms
- none listed
- Built on 1
- pair_codegreeThe codegree of two vertices u and v in a hypergraph H is the number of hyperedges of H containing both u and v.
- Used by 1
- codegree_extremal_numberFor 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…
Read back from the Lean
Given a natural number n and a family H of subsets of Fin n (i.e., a hypergraph with vertex set Fin n), min_pair_codegree n H is defined to be: - if 2 ≤ n, the minimum over all pairs (u, v) ∈ Fin n × Fin n with u ≠ v of the pair codegree of u and v with respect to H; - if n < 2, 0.
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 minimum pair-codegree δ₂(H) of a 3-graph H on Fin n over all pairs of distinct vertices. -/ noncomputable def min_pair_codegree (n : ℕ) (H : Finset (Finset (Fin n))) : ℕ := if h : 2 ≤ n then let pairs := (Finset.univ : Finset (Fin n × Fin n)).filter (fun p => p.1 ≠ p.2) have hp : pairs.Nonempty := by rcases n with _ | _ | n' · omega · omega · exact ⟨⟨⟨0, by omega⟩, ⟨1, by omega⟩⟩, by simp [pairs]⟩ pairs.inf' hp (fun p => pair_codegree H p.1 p.2) else 0