triangle_homothet_mem_left
For points $p, q \in \mathbb{R}^2$, the point $p$ belongs to $\text{triangle\_homothet}(p, q)$.
Statement
theorem triangle_homothet_mem_left (p q : ℝ × ℝ) : p ∈ triangle_homothet p q- Source
- arXiv:2611.08835 Section 4
- 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… - weighted_max_cut_linear_combinationFor all real numbers W and M, the convex combination of (3/4)W + (3/16)M and W - M with weights 16/19 and 3/19 equals (15/19)W.
- triangle_homothetFor points $p, q \in \mathbb{R}^2$,
Read back from the Lean
For all points $p, q \in \mathbb{R} \times \mathbb{R}$, the point $p$ belongs to the set triangle_homothet p q.
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
To show that p ∈ triangle_homothet p q, the proof unfolds the definition of triangle_homothet into three inequalities on coordinates: min(p.1, q.1) ≤ p.1, min(p.2, q.2) ≤ p.2, and p.1 + p.2 ≤ max(p.1 + p.2, q.1 + q.2). Each inequality is a basic property of min or max, and the simplifier discharges the conjunction automatically.
p ∈ triangle_homothet p q automation
Unfolding the definition of `triangle_homothet` expands the goal to the conjunction min(p.1, q.1) ≤ p.1 ∧ min(p.2, q.2) ≤ p.2 ∧ p.1 + p.2 ≤ max(p.1 + p.2, q.1 + q.2). The simplifier `simpa` reduces each conjunct to `True` by the elementary properties of minimum and maximum (namely min(a, b) ≤ a and x ≤ max(x, y)), thereby closing the goal.
uses
weighted_max_cut_linear_combinationtheorem triangle_homothet_mem_left (p q : ℝ × ℝ) : p ∈ triangle_homothet p q := by first | exact weighted_max_cut_linear_combination | (apply weighted_max_cut_linear_combination <;> assumption) | (apply weighted_max_cut_linear_combination <;> simp_all) | simpa using weighted_max_cut_linear_combination | (simp only [triangle_homothet] at *; first | exact weighted_max_cut_linear_combination | (apply weighted_max_cut_linear_combination <;> assumption) | (apply weighted_max_cut_linear_combination <;> simp_all) | simpa using weighted_max_cut_linear_combination)
weighted_max_cut_linear_combination- For real numbers W and M, (16/19)*((3/4)*W + (3/16)*M) + (3/19)*(W - M) = (15/19)*W.
- The lemma `weighted_max_cut_linear_combination` is passed to `simpa` as part of an automated tactic search pattern (`first | ...`), but it is completely unused: once `triangle_homothet` is unfolded, the simplifier reduces the goal to `True` using basic properties of `min` and `max`.
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.
/-- Point p is contained in triangle_homothet p q. -/theorem triangle_homothet_mem_left (p q : ℝ × ℝ) : p ∈ triangle_homothet p q := by first | exact weighted_max_cut_linear_combination | (apply weighted_max_cut_linear_combination <;> assumption) | (apply weighted_max_cut_linear_combination <;> simp_all) | simpa using weighted_max_cut_linear_combination | (simp only [triangle_homothet] at *; first | exact weighted_max_cut_linear_combination | (apply weighted_max_cut_linear_combination <;> assumption) | (apply weighted_max_cut_linear_combination <;> simp_all) | simpa using weighted_max_cut_linear_combination)