segment_endpoints
Given a finite set L : Finset (Sym2 (ℝ × ℝ)) of unordered pairs of points in ℝ × ℝ, segment_endpoints L is the finset of type Finset (ℝ × ℝ) of all endpoints of pairs in L, defined by taking the Finset.biUnion over all unordered pairs in L of their two endpoints.
Statement
noncomputable def segment_endpoints (L : Finset (Sym2 (ℝ × ℝ))) : Finset (ℝ × ℝ)
- 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
A definition of a function segment_endpoints taking a finite set $L$ of unordered pairs of points in $\mathbb{R}^2$ (that is, $L : \mathrm{Finset}(\mathrm{Sym}^2(\mathbb{R} \times \mathbb{R}))$) and returning the finite set of points in $\mathbb{R}^2$ ($\mathrm{Finset}(\mathbb{R} \times \mathbb{R})$) that appear in at least one pair in $L$, computed as the union over all $e \in L$ of the endpoints $\{u, v\}$ representing $e$.
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 finset of all endpoints of segments in a finite family L in Sym2 (ℝ × ℝ). -/ noncomputable def segment_endpoints (L : Finset (Sym2 (ℝ × ℝ))) : Finset (ℝ × ℝ) := Finset.biUnion L (fun e => Sym2.lift ⟨fun u v => ({u, v} : Finset (ℝ × ℝ)), by intro u v; ext x; simp [Finset.mem_insert, Finset.mem_singleton, or_comm]⟩ e)