Reference · Lemmas behind operations-research checks
rainbow.math.lemmas.auc-readings
General lemmas: auc readings. The mathematical facts the corresponding checks rest on, each checked by the kernel.
signed/auc-weight-bounds
signed/auc-weight-bounds : (aw-b1 aw-b2 : data/Bool) → proposition/conjunction (0 ≤ signed/from-nnrat 2 · data/Bool.rec (fun x₄₄ => ℚ) 1 0 aw-b1 + data/Bool.rec (fun x₅₆ => ℚ) 0 (data/Bool.rec (fun x₆₀ => ℚ) 0 1 aw-b2) aw-b1) (signed/from-nnrat 2 · data/Bool.rec (fun x₆₄ => ℚ) 1 0 aw-b1 + data/Bool.rec (fun x₇₆ => ℚ) 0 (data/Bool.rec (fun x₈₀ => ℚ) 0 1 aw-b2) aw-b1 ≤ signed/from-nnrat 2)
+ = signed/add0 = signed/zero1 = signed/one· = signed/multiplyℚ = signed/SignedRational≤ = signed/at-most
signed/complement-nonnegative
signed/complement-nonnegative : (cn-y : ℚ) (cn-h : cn-y · (1 + signed/negate cn-y) = 0) → 0 ≤ 1 + signed/negate cn-y
+ = signed/add0 = signed/zero1 = signed/one= = signed/equivalent: equality of rational values· = signed/multiplyℚ = signed/SignedRational≤ = signed/at-most
signed/auc-unit-interval
signed/auc-unit-interval : (au-a au-p au-n au-w : ℚ) (au-h : signed/from-nnrat 2 · (au-a · (au-p · au-n)) = au-w) (au-h0 : 0 ≤ au-w) (au-h1 : au-w ≤ signed/from-nnrat 2 · (au-p · au-n)) (au-hp : 1 ≤ au-p) (au-hn : 1 ≤ au-n) → proposition/conjunction (0 ≤ au-a) (au-a ≤ 1)
0 = signed/zero1 = signed/one= = signed/equivalent: equality of rational values· = signed/multiplyℚ = signed/SignedRational≤ = signed/at-most