is_iterated_three_edge
A 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 coordinate ℓ in Fin d such that all vertices in e agree on all coordinates strictly less than ℓ, and any two distinct vertices in e have different values at coordinate ℓ.
Statement
def is_iterated_three_edge (d : ℕ) (e : Finset (Fin d → Fin 3)) : Prop
- Defined in
- arXiv:2610.14829 Section 2.2
- Verified
- 23 Oct 2026
- Axioms
- none listed
- Used by 1
- is_iterated_tripartiteA 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…
Read back from the Lean
Given a natural number $d$ and a finite set $e$ of functions from Fin d to Fin 3, is_iterated_three_edge d e asserts that:
1. The cardinality of $e$ is 3; and
2. There exists an index $\ell : \text{Fin } d$ such that:
- For all $u, v \in e$ and all $i : \text{Fin } d$ with $i < \ell$, $u(i) = v(i)$ (all elements of $e$ agree on all coordinates strictly less than $\ell$); and
- For all $u, v \in e$, if $u \neq v$, then $u(\ell) \neq v(\ell)$ (the elements of $e$ have pairwise distinct values at coordinate $\ell$).
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
/-- An edge of the d-times iterated blow-up of a 3-edge (K_3^{(3)})^d on Fin d → Fin 3: a triple of vertices agreeing below level ℓ and pairwise distinct at level ℓ. -/ def is_iterated_three_edge (d : ℕ) (e : Finset (Fin d → Fin 3)) : Prop := e.card = 3 ∧ ∃ ℓ : Fin d, (∀ u ∈ e, ∀ v ∈ e, ∀ i : Fin d, i < ℓ → u i = v i) ∧ (∀ u ∈ e, ∀ v ∈ e, u ≠ v → u ℓ ≠ v ℓ)