Reference · Lemmas behind operations-research checks
rainbow.math.lemmas.one-center
General lemmas: one center. The mathematical facts the corresponding checks rest on, each checked by the kernel.
signed/le-indicator-cases
signed/le-indicator-cases : (p q : ℚ) → proposition/disjunction (data/Bool.rec (fun x₁₆ => ℚ) 0 1 (signed/decide-at-most p q) = 0) (proposition/conjunction (data/Bool.rec (fun x₂₄ => ℚ) 0 1 (signed/decide-at-most p q) = 1) (p ≤ q))
0 = signed/zero1 = signed/one= = signed/equivalent: equality of rational valuesℚ = signed/SignedRational≤ = signed/at-most
signed/eq-indicator-cases
signed/eq-indicator-cases : (p c : ℚ) → proposition/disjunction (data/Bool.rec (fun x₂₈ => ℚ) 0 1 (signed/decide-at-most p c) · data/Bool.rec (fun x₃₂ => ℚ) 0 1 (signed/decide-at-most c p) = 0) (proposition/conjunction (data/Bool.rec (fun x₄₄ => ℚ) 0 1 (signed/decide-at-most p c) · data/Bool.rec (fun x₄₈ => ℚ) 0 1 (signed/decide-at-most c p) = 1) (p = c))
0 = signed/zero1 = signed/one= = signed/equivalent: equality of rational values· = signed/multiplyℚ = signed/SignedRational
signed/indicator-attained-bound
signed/indicator-attained-bound : (I F : ℕ → ℚ) (c R : ℚ) (n : ℕ) (hI : ∀ (idx : ℕ), ∀ (bound : nat/strict-below idx n), proposition/disjunction (I idx = 0) (proposition/conjunction (I idx = 1) (F idx = c))) (hsum : 1 ≤ signed/expr-sum-value (fun si => I si) n) (hb : ∀ (idx : ℕ), ∀ (bound : nat/strict-below idx n), F idx ≤ R) → c ≤ R
0 = signed/zero1 = signed/one= = signed/equivalent: equality of rational valuesℕ = data/Natℚ = signed/SignedRational≤ = signed/at-most
signed/two-times
signed/two-times : (x : ℚ) → signed/from-nnrat 2 · x = x + x
+ = signed/add= = signed/equivalent: equality of rational values· = signed/multiplyℚ = signed/SignedRational
signed/at-most-halve
signed/at-most-halve : (u v : ℚ) (h : u + u ≤ v + v) → u ≤ v
+ = signed/addℚ = signed/SignedRational≤ = signed/at-most
signed/interval-midpoint-covers
signed/interval-midpoint-covers : (ai x r lo hi : ℚ) (lo-a : lo ≤ ai) (a-hi : ai ≤ hi) (xx : x + x = lo + hi) (rr : r + r = hi + signed/negate lo) → proposition/conjunction (ai + signed/negate x ≤ r) (x + signed/negate ai ≤ r)
+ = signed/add= = signed/equivalent: equality of rational valuesℚ = signed/SignedRational≤ = signed/at-most