AFTD Auto-Formalizing Theoretical Domains

segment_blocking_number

def

For a predicate P on finite sets of unordered pairs in Sym2 (ℝ × ℝ) and an integer ℓ, the blocking number segment_blocking_number P ℓ is the supremum in ℕ of cardinalities of finite point sets S in ℝ × ℝ for which there exists a family L of ℓ unordered pairs in Sym2 (ℝ × ℝ) satisfying P such that the endpoints of L and points of S are jointly in general position and L blocks S under P.

Statement

noncomputable def segment_blocking_number
    (P : Finset (Sym2 (ℝ × ℝ)) → 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 1

Read back from the Lean

segment_blocking_number P ℓ is defined as the supremum (sSup in ℕ) of the set of natural numbers p such that there exist: 1. a finite set L of unordered pairs of points in $\mathbb{R}^2$ (Finset (Sym2 (ℝ × ℝ))), and 2. a finite set of points S in $\mathbb{R}^2$ (Finset (ℝ × ℝ)), satisfying all of the following conditions: - The cardinality of L is ℓ. - The predicate P holds for L. - The union of the set of all endpoints of segments in L and the set S is in general position (that is, no three distinct points in segment_endpoints L ∪ S are collinear in $\mathbb{R}^2$). - L blocks S with respect to P (segments_block_points_prop P L S): for every pair of distinct points u, v ∈ S, P does not hold for insert s(u, v) L. - The cardinality of S is 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

/-- The blocking number β_P(ℓ) is the maximum size of a point set blocked by ℓ segments satisfying P in general position. -/
noncomputable def segment_blocking_number
    (P : Finset (Sym2 (ℝ × ℝ)) → Prop) (ℓ : ℕ) : ℕ := open scoped Classical in
  sSup { p : ℕ | ∃ (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