Menu

Rainbow docs menu

Reference · Lemmas behind operations-research checks

rainbow.math.lemmas.vertex-cover-approx

Lemmas behind operations-research checks src/rainbow/math/lemmas/vertex_cover_approx.clj0 definitions, 1 theorems

General lemmas: vertex cover approx. The mathematical facts the corresponding checks rest on, each checked by the kernel.

Depends onmath.sums.value-append math.nat.infinite math.rational.nnrat.identities math.nat.at-most-cancellation math.rational.nnrat.order-equivalence math.rational.nnrat.archimedean math.rational.nnrat.add-monotone math.rational.nnrat.add-cancellation math.rational.nnrat.additive-reassociation math.rational.signed.order-transitivity math.rational.signed.convergence math.rational.signed.order-respects math.rational.signed.limit-uniqueness math.rational.signed.strict-order math.rational.signed.multiply math.rational.nnrat.multiply-commute math.rational.nnrat.product-reassociation math.rational.nnrat.distribute-right math.rational.nnrat.ring math.rational.nnrat.multiply-monotone math.rational.nnrat.order-difference math.rational.signed.multiply-order math.rational.signed.equivalence-laws math.rational.nnrat.minmax math.rational.nnrat.farkas-elim-list math.rational.signed.no-zero-divisors math.rational.signed.decide-order math.rational.signed.decide-reflexive math.logic.boolean-and math.rational.signed.decide-equivalence math.rational.signed.decide-completeness math.rational.signed.unit-laws math.nat.strict-below-split math.nat.strict-below-more math.checks math.nat.at-most-add math.rational.nnrat.harmonic-convergence math.nat.divmod math.rational.signed.minmax math.rational.signed.minmax-algebra math.rational.signed.clamp math.rational.signed.deviation-rows math.rational.signed.absolute math.rational.signed.absolute-algebra math.rational.signed.distance math.nat.linear-order math.rational.signed.add-associative math.nat.semiring math.nat.multiply-zero-split math.rational.nnrat.multiply-zero-split math.nat.monus math.rational.nnrat.monus math.rational.nnrat.add-zero-split math.rational.nnrat.add-cancel-zero math.finite.rational-argmax math.rational.nnrat.order-total math.rational.nnrat.multiply-difference-zero math.linear.vector.norm-nonnegative math.linear.vector.norm-zero-reflection algorithms.proofs.counterfactual-distance-separation algorithms.proofs.counterfactual-distance-laws math.finite.matrix math.linear.matrix.equivalence math.linear.matrix.transpose math.linear.matrix.transpose-equivalence math.linear.matrix.multiply math.linear.matrix.multiply-shape math.linear.matrix.composable math.linear.matrix.composable-multiply math.linear.vector.additive-units math.linear.vector.shape-cancellation math.linear.vector.shape-map math.linear.vector.shape-add math.linear.vector.dot-additive math.linear.vector.dot-bilinear math.linear.vector.dot-negate math.linear.vector.dot-subtract math.linear.vector.dot-scale math.linear.matrix.action-scale math.rational.signed.multiply-nonzero math.rational.signed.order-monotone math.rational.signed.list-sum math.rational.signed.multiply-monotone math.rational.signed.map-sum-algebra math.rational.signed.negate-additive math.rational.signed.lp-objective-negate math.nat.pair-index-inverse math.sums.flow-cut math.sums.nonneg-zero math.rational.signed.multiply-associative math.rational.signed.multiply-ring math.rational.signed.distributive

signed/matching-at-most-vertex-cover

TheoremFor all inputsNo axiomsSource

signed/matching-at-most-vertex-cover :
  (A M : ℕ → ℕ → ℚ) (c : ℕ → ℚ) (n : ℕ)
  (hA0 : ∀ (au : ℕ), ∀ (au-lt : nat/strict-below au n), ∀ (av : ℕ), ∀ (av-lt : nat/strict-below av n), 0 ≤ A au av)
  (hM0 : ∀ (mu : ℕ), ∀ (mu-lt : nat/strict-below mu n), ∀ (mv : ℕ), ∀ (mv-lt : nat/strict-below mv n), 0 ≤ M mu mv)
  (hMA : ∀ (xu : ℕ), ∀ (xu-lt : nat/strict-below xu n), ∀ (xv : ℕ), ∀ (xv-lt : nat/strict-below xv n), M xu xv ≤ A xu xv)
  (hc01 : ∀ (idx : ℕ), ∀ (bound : nat/strict-below idx n), c idx · (1 + signed/negate (c idx)) = 0)
  (hcover : ∀ (idx : ℕ), ∀ (bound : nat/strict-below idx n), signed/expr-sum-value (fun cv => A idx cv · (1 + signed/negate (c idx)) · (1 + signed/negate (c cv))) n ≤ 0)
  (hdeg : ∀ (idx : ℕ), ∀ (bound : nat/strict-below idx n), signed/expr-sum-value (fun ov => M idx ov) n + signed/expr-sum-value (fun iv => M iv idx) n ≤ 1)
  → signed/expr-sum-value (fun mu => signed/expr-sum-value (fun ov => M mu ov) n) n ≤ signed/expr-sum-value (fun tu => c tu) n

+ = signed/add0 = signed/zero1 = signed/one= = signed/equivalent: equality of rational values· = signed/multiplyℕ = data/Natℚ = signed/SignedRational≤ = signed/at-most