Forbidden interval chain
ProvedD1Bound5.forbidden_interval_chaindiophantine-tuplesnumber-theory
The logical interval-chain step used in Section common-intervals. All endpoints are closed. The input intervals need not have distinct ends.
Preamble
import Mathlib.Algebra.Order.Archimedean.Real.Basic
Formal statement
section
namespace D1Bound5
theorem _root_.D1Bound5.forbidden_interval_chain {R : Type*} [LinearOrder R]
(lower upper : ℕ → R) (x : R)
(hstart : lower 0 ≤ x)
(hoverlap : ∀ n, lower (n+1) ≤ upper n)
(hexcluded : ∀ n, ¬ (lower n ≤ x ∧ x ≤ upper n))
(hunbounded : ∃ n, x < lower n) : False := by sorry
end D1Bound5
end
Source
D1Bound5/IntervalChain.lean, lines 5-21, SHA-256 d7dd36dcbdb75d91109bf3d72af86d3dd5262d911be4745485984f19b92291c4. Project: https://github.com/tomislav-math/d1-bound5-lean