Theorem 3.7 — every -tangle structure tree displays all -tangles
ProvedTangleStructTree.Supplement.theorem_3_7abstract-separation-systemsp2o-gran-per-chapterp2o-plan-paperp2o-v1tangle-structure-treestangles
Let be a separation system, let be any set, and let be any -tangle structure tree of . Write for the set of labels on the path from the root to and for its closure.
- For every -tangle of there is a unique leaf of such that
- If all the leaves of are forbidden, then has no -tangle.
So a single tangle structure tree lists every tangle of , each exactly once, at its leaves; no finiteness, order function or condition on is needed.
Differences from the source:
- encoding: a separation tree is a finite rooted tree with an edge labelling β → a SepTree: the finite prefix-closed set of root-path label lists; reason: the child labels of a node are distinct, so the label-list set determines the rooted labelled tree up to root- and label-preserving isomorphism and every finite separation tree arises
Preamble
import Mathlib import Definitions.Def_TangleStructTree_SepSystem import Definitions.Def_TangleStructTree_IsOrientation import Definitions.Def_TangleStructTree_IsConsistent import Definitions.Def_TangleStructTree_sepClosure import Definitions.Def_TangleStructTree_IsTangle import Definitions.Def_TangleStructTree_SepTree import Definitions.Def_TangleStructTree_SepTree_Consistent import Definitions.Def_TangleStructTree_SepTree_IsTST
Formal statement
namespace TangleStructTree
namespace Supplement
variable {E : Type*} [PartialOrder E] [SepSystem E]
/-- **Theorem 3.7** (von Bergen, Diestel, *Tangle structure trees*, arXiv:2601.15870 (STOC 2027 submission build, sha256 7670745…), journal version (Part I), p.7 (PDF 18); = extended abstract Theorem 3.3, p.5). Let `S⃗` be a
separation system, let `ℱ` be any set, and let `T` be any `ℱ`-tangle structure tree of `S⃗`.
(i) For every `ℱ`-tangle `τ` of `S` there is a unique leaf `ℓ` of `T` such that `⌊β_ℓ⌋ = τ`.
(ii) If all the leaves of `T` are forbidden, then `S` has no `ℱ`-tangle.
**Formalization Note** Nodes are root-path label lists (`SepTree`), `β_ℓ` is `labels ℓ` and
`⌊β_ℓ⌋` is `sepClosure (labels ℓ)`. No finiteness, order function, richness or standardness is
assumed. -/
theorem theorem_3_7 (ℱ : Set (Set E)) (T : SepTree E) (hT : T.IsTST ℱ) :
(∀ τ : Set E, IsTangle ℱ τ → ∃! ℓ : List E, T.IsLeaf ℓ ∧ sepClosure (labels ℓ) = τ) ∧
((∀ ℓ : List E, T.IsLeaf ℓ → T.IsForbiddenLeaf ℱ ℓ) → ¬ ∃ τ : Set E, IsTangle ℱ τ) := by sorry
end Supplement
end TangleStructTree
Source
von Bergen, Diestel, Tangle structure trees, arXiv:2601.15870 (STOC 2027 submission build of 2026-10-31, sha256 7670745285d0070c890a0203dfe9e72ef24717b9e9d824274becd54ce276803b), journal version (Part I), Theorem 3.7, p.7 (PDF 18); = extended abstract Theorem 3.3, p.5