ProbabilisticTheory.OrderUnitSpace.exists_real_shift_nonneg
theoremverifiedformalizationimported Lean
Every element becomes nonnegative after adding enough copies of the order unit: the positive cone reaches everywhere, once you're allowed to shift by the 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_real_shift_nonneg (A : E) : ∃ r : ℝ, 0 ≤ r • (1 : E) + A
- Formalizes
- Physlib, `ProbabilisticTheory.OrderUnitSpace.exists_real_shift_nonneg`
- 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_real_shift_nonneg← ProbabilisticTheory.OrderUnitSpace.exists_real_shift_nonneg (Physlib/ProbabilisticTheory/OrderUnit/Basic.lean:93): 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
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 becomes nonnegative after adding enough copies of the order unit: the positive cone reaches everywhere, once you're allowed to shift by the unit. -/lemma ProbabilisticTheory.OrderUnitSpace.exists_real_shift_nonneg (A : E) : ∃ r : ℝ, 0 ≤ r • (1 : E) + A := by obtain ⟨n, hn⟩ := exists_nsmul_one_le (-A) use n rw [← sub_neg_eq_add, sub_nonneg] exact_mod_cast hn