ProbabilisticTheory.ArchimedeanOrderUnitSpace
classimported Lean
An order-unit space whose distinguished order unit is Archimedean.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in class ProbabilisticTheory.ArchimedeanOrderUnitSpace (E : Type*) extends OrderUnitSpace E
- Defined in
- Physlib, `ProbabilisticTheory.ArchimedeanOrderUnitSpace`
- 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.ArchimedeanOrderUnitSpace← ProbabilisticTheory.ArchimedeanOrderUnitSpace (Physlib/ProbabilisticTheory/OrderUnit/Archimedean.lean:58): verbatim
- Verified
- 10 Oct 2026
- Axioms
- none listed
- 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 20
- prob_simplex_concaveOn_of_hasDerivAt2A function on the open probability simplex {r : ∀x, 0 < r x, Σ r = 1} is concave if, at every point r of it and in every direction v with…
- ProbabilisticTheory.ArchimedeanOrderUnitSpace.orderUnitBounds_nonemptyEvery element has some order-unit bound.
- ProbabilisticTheory.ArchimedeanOrderUnitSpace.orderUnitNorm_leAny order-unit bound on
Ais an upper bound forA's order-unit norm. - ProbabilisticTheory.ArchimedeanOrderUnitSpace.add_mem_orderUnitBoundsA bound for
Aand a bound forBadd up to a bound forA + B. - ProbabilisticTheory.ArchimedeanOrderUnitSpace.orderUnitNorm_nonnegThe order-unit norm is an infimum of nonnegative reals, hence itself nonnegative.
- ProbabilisticTheory.ArchimedeanOrderUnitSpace.orderUnitNorm_add_leProbabilisticTheory.ArchimedeanOrderUnitSpace.orderUnitNorm_add_le
- ProbabilisticTheory.ArchimedeanOrderUnitSpace.orderUnitNormThe order-unit norm is the infimum of the order-unit bounds.
- magic_square_guess_fn_concaveOnThe function g = magic_square_guess_fn — g(w) is the supremum of the adversary's probability of guessing Alice's complete first-row answer…
- tournament_degree_prod_le_regularFor n ≥ 2 and any real numbers x_1, ..., x_n ≥ 1 summing to n^2, the product ∏_{i=1}^n (x_i^2 + n) is at most (n(n+1))^n.
- Real.negMulLog_strictAntiOnReal.negMulLog_strictAntiOn
- ProbabilisticTheory.Effect.two_smul_two_inv_smul_one_add_sub_oneUndoing the re-centering, then redoing it, returns the original ball point.
- ProbabilisticTheory.ArchimedeanOrderUnitSpace.exists_orderUnitBound_ltThere is an order-unit bound on
Awithinεof its norm. - ternary_lift_realApproxDegree_leSuppose n, d : ℕ with 40 ≤ n. If f : (Fin n → Bool) → Bool, P : (Fin n → Bool) → ℝ is in degreeSpace ℝ (Fin n) d, and Z : (Fin n → Bool) →…
- ProbabilisticTheory.instArchimedeanOrderUnitSpaceRealThe real numbers form an Archimedean order-unit space.
- ProbabilisticTheory.ArchimedeanOrderUnitSpace.orderUnitNorm_zeroProbabilisticTheory.ArchimedeanOrderUnitSpace.orderUnitNorm_zero
- Real.negMulLog_strictMonoOnReal.negMulLog_strictMonoOn
- ProbabilisticTheory.ArchimedeanOrderUnitSpace.orderUnitBounds_negNegation preserves the set of order-unit bounds: a symmetric interval bounding
Abounds-Atoo. - ProbabilisticTheory.ArchimedeanOrderUnitSpace.orderUnitBounds_bddBelowThe order-unit bounds are bounded below by
0. - k_submod_c1_hidden_fn_orthant_diminishing_returnsFor all natural numbers n > 0 and k ≥ 2, every hidden assignment σ : Fin n → Fin k, and every function H : ℝ → ℝ → ℝ satisfying…
- ProbabilisticTheory.ArchimedeanOrderUnitSpace.orderUnitNorm_negProbabilisticTheory.ArchimedeanOrderUnitSpace.orderUnitNorm_neg
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- An order-unit space whose distinguished order unit is Archimedean. -/ class ProbabilisticTheory.ArchimedeanOrderUnitSpace (E : Type*) extends OrderUnitSpace E where /-- If `A` is smaller than every positive multiple of `1`, `A` is already `≤ 0`. -/ le_zero_of_forall_pos_smul_one_le : ∀ A : E, (∀ ε : ℝ, 0 < ε → A ≤ ε • (1 : E)) → A ≤ 0