AFTD Auto-Formalizing Theoretical Domains

EconCSLib.LinearAlgebra.liftCert_nonneg

theoremverifiedformalizationimported Lean

Pointwise nonneg lift.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
set_option linter.unusedSectionVars false in
variable {๐•œ : Type*} [Field ๐•œ] [LinearOrder ๐•œ] [IsStrictOrderedRing ๐•œ] in
variable {I : Type*} [Fintype I] [DecidableEq I] {n : โ„•} in
theorem EconCSLib.LinearAlgebra.liftCert_nonneg (A : I โ†’ Fin (n+1) โ†’ ๐•œ) {u' : FMRowIndex A โ†’ ๐•œ}
    (hu' : โˆ€ idx, 0 โ‰ค u' idx) (i : I) : 0 โ‰ค liftCert A u' i
Formalizes
EconCSLib, `EconCSLib.LinearAlgebra.liftCert_nonneg`
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
Built on 12
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators inset_option linter.unusedSectionVars false invariable {๐•œ : Type*} [Field ๐•œ] [LinearOrder ๐•œ] [IsStrictOrderedRing ๐•œ] invariable {I : Type*} [Fintype I] [DecidableEq I] {n : โ„•} in/-- Pointwise nonneg lift. -/theorem EconCSLib.LinearAlgebra.liftCert_nonneg (A : I โ†’ Fin (n+1) โ†’ ๐•œ) {u' : FMRowIndex A โ†’ ๐•œ}    (hu' : โˆ€ idx, 0 โ‰ค u' idx) (i : I) : 0 โ‰ค liftCert A u' i := by  apply Finset.sum_nonneg  intro idx _  apply mul_nonneg _ (hu' idx)  rcases idx with k | โŸจp, qโŸฉ  ยท simp only [liftCoeff_inl]; split_ifs <;> norm_num  ยท simp only [liftCoeff_inr]    apply add_nonneg    ยท split_ifs with hp      ยท linarith [q.property]      ยท norm_num    ยท split_ifs with hq      ยท exact p.property.le      ยท norm_num
See it in the graphDiscuss this resultChallenge it