AFTD Auto-Formalizing Theoretical Domains

segments_block_points_prop

def

For a predicate P on finite sets of unordered pairs in Sym2 (ℝ × ℝ), a finite set L of unordered pairs in Sym2 (ℝ × ℝ), and a finite set S of points in ℝ × ℝ, segments_block_points_prop P L S asserts that for every pair of distinct points u, v in S, P does not hold on the insertion of the unordered pair s(u, v) into L.

Statement

def segments_block_points_prop (P : Finset (Sym2 (ℝ × ℝ)) → Prop)
    (L : Finset (Sym2 (ℝ × ℝ))) (S : Finset (ℝ × ℝ)) : Prop
Defined in
arXiv:2610.23130, Definition 1.1
Verified
22 Oct 2026
Axioms
none listed
Used by 5
  • greedy_matching_fraction_ge_of_blocking_leLet P be a hereditary segment property. If β_P(ℓ) ≤ p (formalized by segment_blocking_bound_le P ℓ p), then on every duplicate-free list…
  • greedy_matching_fraction_le_of_blocking_geLet P be a hereditary segment property. If β_P(ℓ) ≥ p (formalized by segment_blocking_bound_ge P ℓ p), then there exists a duplicate-free…
  • segment_blocking_bound_leFor a segment property P on Finset (Sym2 (ℝ × ℝ)) and natural numbers ℓ and p, segment_blocking_bound_le P ℓ p asserts that every finite…
  • segment_blocking_bound_geFor a segment property P on Finset (Sym2 (ℝ × ℝ)) and natural numbers ℓ and p, segment_blocking_bound_ge P ℓ p asserts that there exists a…
  • segment_blocking_numberFor a predicate P on finite sets of unordered pairs in Sym2 (ℝ × ℝ) and an integer ℓ, the blocking number segment_blocking_number P ℓ is…

Read back from the Lean

For a predicate P on finite sets of unordered pairs of points in ℝ², a finite set L of unordered pairs of points in ℝ², and a finite set S of points in ℝ², segments_block_points_prop P L S asserts that for all points u, v : ℝ × ℝ, if u ∈ S, v ∈ S, and u ≠ v, then P does not hold on insert s(u, v) L (the set L with the unordered pair {u, v} inserted).

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 segment family L blocks a point set S under property P if adding any segment between distinct points of S violates P. -/
def segments_block_points_prop (P : Finset (Sym2 (ℝ × ℝ)) → Prop)
    (L : Finset (Sym2 (ℝ × ℝ))) (S : Finset (ℝ × ℝ)) : Prop := ∀ ⦃u v : ℝ × ℝ⦄, u ∈ S → v ∈ S → u ≠ v → ¬ P (insert s(u, v) L)
See it in the graphDiscuss this resultChallenge it