IsHereditarySegmentProperty
def
A predicate P on finite sets of unordered pairs in Sym2 (ℝ × ℝ) is a hereditary segment property if P holds on the empty finset and for all finite sets of unordered pairs s and t in Finset (Sym2 (ℝ × ℝ)), if s ⊆ t and P t holds, then P s holds.
Statement
def IsHereditarySegmentProperty (P : Finset (Sym2 (ℝ × ℝ)) → Prop) : Prop
- Defined in
- arXiv:2610.23130, Section 1
- Verified
- 22 Oct 2026
- Axioms
- none listed
- Used by 5
- greedy_matching_ratio_equiv_blocking_boundsTheorem 1.2 (arXiv:2610.23130): Let P be a hereditary segment crossing property. (1) If the blocking number β_P(ℓ) ≤ p (every family of ℓ…
- isHereditarySegmentProperty_trueThe constantly true predicate on Finset (Sym2 (ℝ × ℝ)) is a hereditary segment property.
- not_greedy_fraction_le_of_blocking_geThe statement
greedy_fraction_le_of_blocking_geis false: The statement is false as written; a machine-checked refutation is provided.… - 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…
Read back from the Lean
A property P on finite sets of unordered pairs of points in ℝ × ℝ satisfies IsHereditarySegmentProperty if and only if: (1) P holds for the empty set, and (2) for all finite sets s and t of unordered pairs of points in ℝ × ℝ, if s ⊆ t and P t holds, then P s holds (i.e., P is downward-closed under subset inclusion).
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 property is hereditary if it holds for the empty set and is closed under taking sub-families. -/ def IsHereditarySegmentProperty (P : Finset (Sym2 (ℝ × ℝ)) → Prop) : Prop := P ∅ ∧ ∀ ⦃s t : Finset (Sym2 (ℝ × ℝ))⦄, s ⊆ t → P t → P s