descending_band_point_mem
For any integer d and natural numbers r and L with 1 ≤ r and r ≤ L, the pair (descending_band_cost d r L, descending_band_vulnerability d r L) belongs to descending_band_points d.
Statement
theorem descending_band_point_mem (d : ℤ) {r L : ℕ} (hr : 1 ≤ r) (hrL : r ≤ L) : (descending_band_cost d r L, descending_band_vulnerability d r L) ∈ descending_band_points d- Source
- OP-1702
- Verified
- 15 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- descending_band_pointsFor an integer d, descending_band_points d is the set of all pairs (descending_band_cost d r L, descending_band_vulnerability d r L) in ℝ…
- descending_band_vulnerabilityFor an integer d and natural numbers r and L, let A = descending_band_set d r L and let S : Finset ℤ be the union over a ∈ A of {a, a + 1,…
- descending_band_costFor integers $d \in \mathbb{Z}$ and $r, L \in \mathbb{N}$, the descending band cost
descending_band_cost d r Lis the infimum over all…
Read back from the Lean
For any integer d and any natural numbers r and L (both implicit), if 1 ≤ r and r ≤ L, then the pair (descending_band_cost d r L, descending_band_vulnerability d r L) belongs to descending_band_points d.
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 theorem follows directly from the definition of `descending_band_points d` as the set of pairs `(descending_band_cost d r' L', descending_band_vulnerability d r' L')` over all $r', L'$ satisfying $1 ≤ r' ≤ L'$. Providing $r$ and $L$ together with the hypotheses $1 ≤ r$ and $r ≤ L$ immediately satisfies the existential condition defining the set.
The pair `(descending_band_cost d r L, descending_band_vulnerability d r L)` belongs to `descending_band_points d`.
By definition, `descending_band_points d` is the set of all pairs `(descending_band_cost d r' L', descending_band_vulnerability d r' L')` for which there exist natural numbers $r'$ and $L'$ with $1 ≤ r' ≤ L'$. Supplying the witnesses $r' = r$ and $L' = L$, the hypotheses $hr : 1 ≤ r$ and $hrL : r ≤ L$, and the reflexivity of equality demonstrates set membership directly.
theorem descending_band_point_mem (d : ℤ) {r L : ℕ} (hr : 1 ≤ r) (hrL : r ≤ L) : (descending_band_cost d r L, descending_band_vulnerability d r L) ∈ descending_band_points d := ⟨r, L, hr, hrL, rfl⟩
- The proof is given in term mode as an explicit constructor tuple `⟨r, L, hr, hrL, rfl⟩` rather than using a tactic block.
Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
/-- Every descending band set with 1 ≤ r ≤ L generates a point in descending_band_points -/theorem descending_band_point_mem (d : ℤ) {r L : ℕ} (hr : 1 ≤ r) (hrL : r ≤ L) : (descending_band_cost d r L, descending_band_vulnerability d r L) ∈ descending_band_points d := ⟨r, L, hr, hrL, rfl⟩