ProbabilisticTheory.OrderUnitSpace.exists_two_sided_bound
theoremverifiedformalizationimported Lean
Every element is bounded on both sides by a natural multiple of the order unit.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open ProbabilisticTheory in variable {E : Type*} [OrderUnitSpace E] in lemma ProbabilisticTheory.OrderUnitSpace.exists_two_sided_bound (A : E) : ∃ n : ℕ, -(n • (1 : E)) ≤ A ∧ A ≤ n • (1 : E)
- Formalizes
- Physlib, `ProbabilisticTheory.OrderUnitSpace.exists_two_sided_bound`
- Lean proof
- By Tom Ole Diem, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2026 Tom Ole Diem. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.ProbabilisticTheory.OrderUnitSpace.exists_two_sided_bound← ProbabilisticTheory.OrderUnitSpace.exists_two_sided_bound (Physlib/ProbabilisticTheory/OrderUnit/Basic.lean:78): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- ProbabilisticTheory.OrderUnitSpaceAn ordered real vector space whose distinguished element
1is an order unit: it is nonnegative, and every element is bounded above by a… - ProbabilisticTheory.OrderedVectorSpaceAn ordered real vector space.
- ProbabilisticTheory.OrderUnitSpaceAn ordered real vector space whose distinguished element
- Used by 1
- ProbabilisticTheory.ArchimedeanOrderUnitSpace.orderUnitBounds_nonemptyEvery element has some order-unit bound.
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.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen ProbabilisticTheory invariable {E : Type*} [OrderUnitSpace E] in/-- Every element is bounded on both sides by a natural multiple of the order unit. -/lemma ProbabilisticTheory.OrderUnitSpace.exists_two_sided_bound (A : E) : ∃ n : ℕ, -(n • (1 : E)) ≤ A ∧ A ≤ n • (1 : E) := by obtain ⟨n, hn⟩ := exists_nsmul_one_le A obtain ⟨m, hm⟩ := exists_nsmul_one_le (-A) refine ⟨max n m, ?_, hn.trans (nsmul_le_nsmul_left one_nonneg (le_max_left n m))⟩ exact neg_le_of_neg_le <| hm.trans (nsmul_le_nsmul_left one_nonneg (le_max_right n m))