is_iterated_tripartite
A hypergraph F is iterated tripartite if there exist a dimension d and a vertex coloring χ : V → (Fin d → Fin 3) that is injective on the vertices incident to edges of F (the union of all edges in F) such that for every hyperedge e in F, the image of e under χ is an edge of the d-iterated blow-up of a single 3-edge (is_iterated_three_edge d (e.image χ)).
Statement
def is_iterated_tripartite {V : Type*} [DecidableEq V] (F : Finset (Finset V)) : Prop
- Defined in
- arXiv:2610.14829 Section 2.2
- Verified
- 23 Oct 2026
- Axioms
- none listed
- Built on 1
- is_iterated_three_edgeA 3-element subset e of vertices in (Fin d → Fin 3) is an edge of the d-times iterated blow-up of a single 3-edge if there exists a…
Read back from the Lean
Given a type V with decidable equality and a family of finite subsets F : Finset (Finset V), is_iterated_tripartite F asserts that there exist a dimension d : ℕ and a coloring/embedding χ : V → (Fin d → Fin 3) such that:
1. χ is injective when restricted to the vertices present in F (that is, for all u, v ∈ ⋃ e ∈ F, e, if χ u = χ v then u = v), and
2. for every hyperedge e ∈ F, its image e.image χ is an iterated 3-edge in dimension d:
- e.image χ has cardinality 3 (hence e itself has cardinality 3 and χ maps its 3 vertices injectively into Fin d → Fin 3), and
- there exists a coordinate index ℓ : Fin d such that:
- for all u, v ∈ e.image χ and every coordinate i : Fin d with i < ℓ, u i = v i (all three vertices agree on all coordinates before ℓ), and
- for all distinct u, v ∈ e.image χ, u ℓ ≠ v ℓ (the three vertices take distinct values in Fin 3 at coordinate ℓ).
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 hypergraph F is iterated tripartite if it embeds as a subgraph into an iterated blow-up of a single 3-edge. -/ def is_iterated_tripartite {V : Type*} [DecidableEq V] (F : Finset (Finset V)) : Prop := ∃ (d : ℕ) (χ : V → (Fin d → Fin 3)), (∀ u ∈ F.biUnion id, ∀ v ∈ F.biUnion id, χ u = χ v → u = v) ∧ ∀ e ∈ F, is_iterated_three_edge d (e.image χ)