AFTD Auto-Formalizing Theoretical Domains

segments_block_points

def

A finite family of segments L blocks a finite point set P under the triangle-free crossing property if for every pair of distinct points u, v in P, adding the segment uv to L creates a triangle in the crossing graph.

Statement

def segments_block_points (L : Finset (Sym2 (ℝ × ℝ))) (P : Finset (ℝ × ℝ)) : Prop
Defined in
arXiv:2610.23130 Def. 1.1
Verified
20 Oct 2026
Axioms
none listed
Built on 1
  • segment_crossing_graphThe crossing graph G(L) of a finite family of line segments L is the simple graph with vertex set L and edges between segments whose…
Used by 6

Read back from the Lean

Given a finite set of segments L (represented as unordered pairs of points in ℝ × ℝ) and a finite set of points P in ℝ × ℝ, segments_block_points L P asserts that for every pair of points u, v : ℝ × ℝ, if u ∈ P, v ∈ P, and u ≠ v, then the segment crossing graph on insert s(u, v) L is not 3-clique-free (that is, the graph contains a 3-clique: three segments in insert s(u, v) L whose open segments pairwise intersect).

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 family of segments blocks a point set under the triangle-free crossing property. -/
def segments_block_points (L : Finset (Sym2 (ℝ × ℝ))) (P : Finset (ℝ × ℝ)) : Prop := ∀ ⦃u v : ℝ × ℝ⦄, u ∈ P → v ∈ P → u ≠ v →
    ¬ (segment_crossing_graph (insert s(u, v) L)).CliqueFree 3
See it in the graphDiscuss this resultChallenge it