tripartite_turan_hypergraph
Given a type α with decidable equality and a family of finite sets V : ZMod 3 → Finset α, tripartite_turan_hypergraph V is the finite set of 3-element subsets e of the union Finset.univ.biUnion V such that either for all i : ZMod 3, (e ∩ V i).card = 1, or there exists some i : ZMod 3 such that (e ∩ V i).card = 2 and (e ∩ V (i + 1)).card = 1.
Statement
def tripartite_turan_hypergraph {α : Type*} [DecidableEq α] (V : ZMod 3 → Finset α) : Finset (Finset α)
- Defined in
- arXiv:2611.16654 Section 3
- Verified
- 14 Nov 2026
- Axioms
- none listed
- Used by 3
- zycle_not_div_three_no_hom_tripartite_turanLet ℓ ≥ 2 be an integer with 3 ∤ ℓ. For any family of pairwise disjoint finite sets V : ZMod 3 → Finset α, there is no function f : ZMod ℓ…
- tripartite_turan_pair_digraph_no_closed_walkFor any family of pairwise disjoint finite sets V : ZMod 3 → Finset α and any integer ℓ with 3 ∤ ℓ, there is no closed walk W : ZMod ℓ →…
- tripartite_turan_hypergraph_three_uniformFor any family of finite sets V : ZMod 3 → Finset α, the tripartite Turán hypergraph tripartite_turan_hypergraph V is 3-uniform…
Read back from the Lean
Given a type α with decidable equality and a family of finite subsets V : ZMod 3 → Finset α, tripartite_turan_hypergraph V is the finite set of all 3-element subsets e of the union ⋃_{i ∈ ℤ/3ℤ} V(i) such that either:
1. for every i ∈ ℤ/3ℤ, |e ∩ V(i)| = 1; or
2. there exists some i ∈ ℤ/3ℤ such that |e ∩ V(i)| = 2 and |e ∩ V(i + 1)| = 1.
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 3-uniform tripartite Turán construction on three parts V₀, V₁, V₂. -/ def tripartite_turan_hypergraph {α : Type*} [DecidableEq α] (V : ZMod 3 → Finset α) : Finset (Finset α) := ((Finset.univ.biUnion V).powersetCard 3).filter fun e => (∀ i : ZMod 3, (e ∩ V i).card = 1) ∨ (∃ i : ZMod 3, (e ∩ V i).card = 2 ∧ (e ∩ V (i + 1)).card = 1)