triangle_homothet_mem_iff_avoid_regions
For a finite set $P \subset \mathbb{R}^2$ and points $p, q, r \in \mathbb{R}^2$ with $p, q \in P$, $r \in \text{triangle\_homothet}(p, q)$ if and only if for each index $i \in \{0, 1, 2\}$, it is not the case that both $p \in \text{triangle\_region}(P, r, i)$ and $q \in \text{triangle\_region}(P, r, i)$.
Statement
theorem triangle_homothet_mem_iff_avoid_regions (P : Finset (ℝ × ℝ)) (p q r : ℝ × ℝ)
(hp : p ∈ P) (hq : q ∈ P) :
r ∈ triangle_homothet p q ↔
∀ i : Fin 3, ¬(p ∈ triangle_region P r i ∧ q ∈ triangle_region P r i)- Source
- arXiv:2611.08835 Lemma 8 proof, Step 1
- Verified
- 09 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- triangle_homothetFor points $p, q \in \mathbb{R}^2$,
triangle_homothet p qis defined as the set of points $r \in \mathbb{R}^2$ such that… - triangle_regionFor a point $r \in \mathbb{R}^2$ and finite set $P \subset \mathbb{R}^2$, $A_0(r) = \{q \in P : r_x < q_x\}$,…
- triangle_homothetFor points $p, q \in \mathbb{R}^2$,
Read back from the Lean
For any finite set $P \subseteq \mathbb{R} \times \mathbb{R}$ and any points $p, q, r \in \mathbb{R} \times \mathbb{R}$, assuming $p \in P$ and $q \in P$: $r \in \text{triangle\_homothet}(p, q)$ if and only if for every index $i \in \text{Fin } 3$, it is not the case that both $p \in \text{triangle\_region}(P, r, i)$ and $q \in \text{triangle\_region}(P, r, i)$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The proof shows that the three inequalities defining membership in the homothetic triangle triangle_homothet(p, q) correspond coordinate-by-coordinate to avoiding the three regions triangle_region(P, r, i) for i ∈ {0, 1, 2}. After expanding the universal quantifier over the three indices and simplifying the region definitions using the assumptions p, q ∈ P, the statement reduces to showing that each homothet inequality is equivalent to avoiding the corresponding region. This equivalence follows directly from the linear order dualities min(a, b) ≤ c ↔ ¬(c < a ∧ c < b) and c ≤ max(a, b) ↔ ¬(a < c ∧ b < c).
A universal quantification over Fin 3 is equivalent to the three-way conjunction of the predicate evaluated at 0, 1, and 2.
For any predicate A on Fin 3, the forward direction specializes the hypothesis ∀ i, A i to the three indices 0, 1, and 2. The backward direction takes the conjunction A 0 ∧ A 1 ∧ A 2 and proves A i for any i : Fin 3 by exhaustive case analysis (`fin_cases i`), matching each case to the assumed conjunct.
have h_forall (A : Fin 3 → Prop) : (∀ i, A i) ↔ A 0 ∧ A 1 ∧ A 2 := by constructor · intro h; exact ⟨h 0, h 1, h 2⟩ · rintro ⟨h0, h1, h2⟩ i fin_cases i <;> assumption
The equivalence is expressed in terms of coordinate inequalities: min p.1 q.1 ≤ r.1 ∧ min p.2 q.2 ≤ r.2 ∧ r.1 + r.2 ≤ max (p.1 + p.2) (q.1 + q.2) if and only if ¬(r.1 < p.1 ∧ r.1 < q.1) ∧ ¬(r.2 < p.2 ∧ r.2 < q.2) ∧ ¬(p.1 + p.2 < r.1 + r.2 ∧ q.1 + q.2 < r.1 + r.2).
Rewriting with `h_forall` expands the condition that p and q do not both lie in region i for all i ∈ {0, 1, 2} into a conjunction of three explicit conditions. Unfolding `triangle_homothet` and `triangle_region`, each membership condition x ∈ triangle_region P r i is defined by filtering the set P. Since p ∈ P (hp) and q ∈ P (hq), the condition x ∈ P is trivially satisfied (`Finset.mem_filter`, `true_and`), leaving only the coordinate inequalities.
uses
Finset.mem_filter,true_andrw [h_forall] dsimp [triangle_homothet, triangle_region] simp only [Finset.mem_filter, hp, hq, true_and]
Each inequality defining membership in the homothet is equivalent to avoiding the corresponding region, completing the proof.
For the first coordinate, min p.1 q.1 ≤ r.1 is rewritten as ¬(r.1 < min p.1 q.1) via `not_lt`, and then as ¬(r.1 < p.1 ∧ r.1 < q.1) via `lt_min_iff`. The second coordinate min p.2 q.2 ≤ r.2 is similarly rewritten to ¬(r.2 < p.2 ∧ r.2 < q.2). Finally, the sum condition r.1 + r.2 ≤ max (p.1 + p.2) (q.1 + q.2) is rewritten as ¬(max (p.1 + p.2) (q.1 + q.2) < r.1 + r.2) via `not_lt`, and then as ¬(p.1 + p.2 < r.1 + r.2 ∧ q.1 + q.2 < r.1 + r.2) via `max_lt_iff`. Both sides of the equivalence are now identical, which closes the goal.
uses
not_lt,lt_min_iff,max_lt_iffrw [← not_lt, lt_min_iff] rw [← not_lt, lt_min_iff] rw [← not_lt, max_lt_iff]
Finset.mem_filter- An element belongs to a filtered set {x ∈ s | p x} if and only if it belongs to s and satisfies the predicate p.
true_and- The conjunction True ∧ p is equivalent to p.
not_lt- In a linear order, a is not strictly less than b if and only if b ≤ a.
lt_min_iff- A value a is strictly less than min b c if and only if a < b and a < c.
max_lt_iff- The maximum max b c is strictly less than a if and only if b < a and c < a.
- The helper lemma `h_forall` (lines 6–10) is a formal step to expand a universal quantifier over the three-element type `Fin 3` into a three-way conjunction; on paper this unpack is taken for granted.
- At line 16, rewriting the third inequality makes both sides of the `↔` syntactically identical, and the `rw` tactic automatically closes the goal by reflexivity.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- Characterization of containment in T(p,q) via avoiding the regions Aᵢ(r). -/theorem triangle_homothet_mem_iff_avoid_regions (P : Finset (ℝ × ℝ)) (p q r : ℝ × ℝ) (hp : p ∈ P) (hq : q ∈ P) : r ∈ triangle_homothet p q ↔ ∀ i : Fin 3, ¬(p ∈ triangle_region P r i ∧ q ∈ triangle_region P r i) := by have h_forall (A : Fin 3 → Prop) : (∀ i, A i) ↔ A 0 ∧ A 1 ∧ A 2 := by constructor · intro h; exact ⟨h 0, h 1, h 2⟩ · rintro ⟨h0, h1, h2⟩ i fin_cases i <;> assumption rw [h_forall] dsimp [triangle_homothet, triangle_region] simp only [Finset.mem_filter, hp, hq, true_and] rw [← not_lt, lt_min_iff] rw [← not_lt, lt_min_iff] rw [← not_lt, max_lt_iff]