AFTD Auto-Formalizing Theoretical Domains

segment_blocking_bound_le

def

For a segment property P on Finset (Sym2 (ℝ × ℝ)) and natural numbers ℓ and p, segment_blocking_bound_le P ℓ p asserts that every finite family L of ℓ segments satisfying P blocks at most p points in any finite point set S such that the endpoints of L and S are jointly in general position.

Statement

def segment_blocking_bound_le (P : Finset (Sym2 (ℝ × ℝ)) → Prop) (ℓ p : ℕ) : Prop
Defined in
arXiv:2610.23130 Definition 1.1
Verified
22 Oct 2026
Axioms
none listed
Built on 3
  • points_in_general_positionA set S of points in the real plane ℝ × ℝ is in general position if for all pairwise distinct points p₁, p₂, p₃ in S, the three-element…
  • segment_endpointsGiven a finite set L : Finset (Sym2 (ℝ × ℝ)) of unordered pairs of points in ℝ × ℝ, segment_endpoints L is the finset of type Finset (ℝ ×…
  • segments_block_points_propFor 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…
Used by 2

Read back from the Lean

The definition segment_blocking_bound_le takes a predicate P on finite sets of unordered pairs of points in ℝ², and two natural numbers ℓ and p. It asserts that for every finite set L of unordered pairs of points in ℝ² and every finite set S of points in ℝ²: if: 1. L has cardinality ℓ, 2. P L holds, 3. the union of the endpoints of the pairs in L and the points in S is in general position (i.e., no three pairwise distinct points in this union are collinear in ℝ²), and 4. L and S satisfy segments_block_points_prop P L S (i.e., for any two distinct points u, v ∈ S, adding the unordered pair {u, v} to L produces a set that does not satisfy P), then the cardinality of S is at most p.

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

/-- Asserts that the blocking number β_P(ℓ) is at most p: every family of ℓ segments satisfying P blocks at most p points in general position. -/
def segment_blocking_bound_le (P : Finset (Sym2 (ℝ × ℝ)) → Prop) (ℓ p : ℕ) : Prop := ∀ (L : Finset (Sym2 (ℝ × ℝ))) (S : Finset (ℝ × ℝ)),
    L.card = ℓ → P L →
    points_in_general_position (segment_endpoints L ∪ S : Set (ℝ × ℝ)) →
    segments_block_points_prop P L S → S.card ≤ p
See it in the graphDiscuss this resultChallenge it