Reference · Finite sums
rainbow.math.sums.zero-violations
Zero positive-part penalties mean no violated inequality; a minimum encodes disjunction.
signed/positive-part-zero-of-nonpositive
signed/positive-part-zero-of-nonpositive : (x : ℚ) (nonpositive : x ≤ 0) → data/Bool.rec (fun x₄ => ℚ) 0 x (signed/decide-at-most 0 x) = 0
0 = signed/zero= = signed/equivalent: equality of rational valuesℚ = signed/SignedRational≤ = signed/at-most
signed/nonpositive-of-positive-part-zero
signed/nonpositive-of-positive-part-zero : (x : ℚ) (zero : data/Bool.rec (fun x₄ => ℚ) 0 x (signed/decide-at-most 0 x) = 0) → x ≤ 0
0 = signed/zero= = signed/equivalent: equality of rational valuesℚ = signed/SignedRational≤ = signed/at-most
signed/nonpositive-minimum-implies-disjunction
signed/nonpositive-minimum-implies-disjunction : (x y : ℚ) (nonpositive : data/Bool.rec (fun x₄ => ℚ) y x (signed/decide-at-most x y) ≤ 0) → proposition/disjunction (x ≤ 0) (y ≤ 0)
0 = signed/zeroℚ = signed/SignedRational≤ = signed/at-most
signed/disjunction-implies-nonpositive-minimum
signed/disjunction-implies-nonpositive-minimum : (x y : ℚ) (either : proposition/disjunction (x ≤ 0) (y ≤ 0)) → data/Bool.rec (fun x₄ => ℚ) y x (signed/decide-at-most x y) ≤ 0
0 = signed/zeroℚ = signed/SignedRational≤ = signed/at-most
signed/nonpositive-difference-implies-at-most
signed/nonpositive-difference-implies-at-most : (x y : ℚ) (difference : x + signed/negate y ≤ 0) → x ≤ y
+ = signed/add0 = signed/zeroℚ = signed/SignedRational≤ = signed/at-most
signed/at-most-implies-nonpositive-difference
signed/at-most-implies-nonpositive-difference : (x y : ℚ) (ordered : x ≤ y) → x + signed/negate y ≤ 0
+ = signed/add0 = signed/zeroℚ = signed/SignedRational≤ = signed/at-most
signed/zero-penalty-sum-implies-constraints
signed/zero-penalty-sum-implies-constraints : (W V : ℕ → ℚ) (n : ℕ) (binary : ∀ (idx : ℕ), ∀ (bound : nat/strict-below idx n), proposition/disjunction (W idx = 0) (W idx = 1)) (sum : signed/expr-sum-value (fun entry39139 => W entry39139 · data/Bool.rec (fun x₄ => ℚ) 0 (V entry39139) (signed/decide-at-most 0 (V entry39139))) n ≤ 0) (entry39140 : ℕ) (bound39141 : nat/strict-below entry39140 n) (selected39142 : W entry39140 = 1) → V entry39140 ≤ 0
0 = signed/zero1 = signed/one= = signed/equivalent: equality of rational values· = signed/multiplyℕ = data/Natℚ = signed/SignedRational≤ = signed/at-most
signed/constraints-imply-zero-penalty-sum
signed/constraints-imply-zero-penalty-sum : (W V : ℕ → ℚ) (n : ℕ) (binary : ∀ (idx : ℕ), ∀ (bound : nat/strict-below idx n), proposition/disjunction (W idx = 0) (W idx = 1)) (constraints : ∀ (entry39148 : ℕ), ∀ (bound39149 : nat/strict-below entry39148 n), ∀ (selected39150 : W entry39148 = 1), V entry39148 ≤ 0) → signed/expr-sum-value (fun entry39147 => W entry39147 · data/Bool.rec (fun x₄ => ℚ) 0 (V entry39147) (signed/decide-at-most 0 (V entry39147))) n ≤ 0
0 = signed/zero1 = signed/one= = signed/equivalent: equality of rational values· = signed/multiplyℕ = data/Natℚ = signed/SignedRational≤ = signed/at-most