AFTD Auto-Formalizing Theoretical Domains

linear_comb_lt_of_le_lt

theoremverifiedformalizationimported Lean

Convex combination of "≤ c" and "< c" stays "< c" (provided α ≥ 0 and α < 1).

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators Matrix in
variable {𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] in
variable {I : Type*} [Fintype I] in
set_option linter.unusedSectionVars false in
theorem linear_comb_lt_of_le_lt (x y c : 𝕜) (H1 : x ≤ c) (H2 : y < c)
    {α : 𝕜} (hα₀ : 0 ≤ α) (hα₁ : α < 1) :
    α * x + (1 - α) * y < c
Formalizes
EconCSLib, `linear_comb_lt_of_le_lt`
Lean proof
By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at 1a88f809b538 (Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators Matrix invariable {𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] invariable {I : Type*} [Fintype I] inset_option linter.unusedSectionVars false in/-- Convex combination of "≤ c" and "< c" stays "< c" (provided `α ≥ 0` and `α < 1`). -/theorem linear_comb_lt_of_le_lt (x y c : 𝕜) (H1 : x ≤ c) (H2 : y < c)    {α : 𝕜} (hα₀ : 0 ≤ α) (hα₁ : α < 1) :    α * x + (1 - α) * y < c := by  have hpos : 0 < 1 - α := by linarith  have hxc : 0 ≤ α * (c - x) := mul_nonneg hα₀ (by linarith)  have hyc : 0 < (1 - α) * (c - y) := mul_pos hpos (by linarith)  nlinarith
See it in the graphDiscuss this resultChallenge it