Skip to content
Rainbow docs menu

Reference · Finite types, distributions and Markov chains

rainbow.math.finite.signed-sup-distance

Finite types, distributions and Markov chainssrc/rainbow/math/finite/signed_sup_distance.clj1 definitions, 5 theorems

A native finite supremum metric for signed-valued functions. `metric/finite-signed-sup-distance` folds quotient-safe signed distance over an exact finset enumeration with the established signed maximum. This is the function-space counterpart of `vector/sup-distance`, and supplies the metric laws needed by residual certificates for finite signed Bellman operators. The carrier enumeration need not be exhaustive for the fold laws themselves; clients that turn them into carrier-wide claims must retain an explicit coverage premise. Native, kernel-checked, and axiom-free on D63.

Depends onmath.finite.nnrat-sup-distance

metric/finite-signed-sup-distance

DefinitionSource, line 62

metric/finite-signed-sup-distance.{u} :
  (A : Type u) (source : Finset A) (left right : A → ℚ)
  → ℚ

Finset = finset-data/Finsetℚ = signed/SignedRational

metric/finite-signed-sup-distance-upper-bound

TheoremFor all inputsNo axiomsSource, line 89

metric/finite-signed-sup-distance-upper-bound.{u} :
  (A : Type u) (source : Finset A) (left right : A → ℚ) (state : A)
  (member : state ∈ source)
  → signed/distance (left state) (right state) ≤ metric/finite-signed-sup-distance A source left right

Finset = finset-data/Finsetℚ = signed/SignedRational∈ = finset-data/to-set: membership in a finite set≤ = signed/at-most

metric/finite-signed-sup-distance-bounded

TheoremFor all inputsNo axiomsSource, line 115

metric/finite-signed-sup-distance-bounded.{u} :
  (A : Type u) (source : Finset A) (left right : A → ℚ) (upper : ℚ)
  (zero-upper : 0 ≤ upper)
  (pointwise : ∀ (state : A), ∀ (member : state ∈ source), signed/distance (left state) (right state) ≤ upper)
  → metric/finite-signed-sup-distance A source left right ≤ upper

0 = signed/zeroFinset = finset-data/Finsetℚ = signed/SignedRational∈ = finset-data/to-set: membership in a finite set≤ = signed/at-most

metric/finite-signed-sup-distance-nonnegative

TheoremFor all inputsNo axiomsSource, line 154

metric/finite-signed-sup-distance-nonnegative.{u} :
  (A : Type u) (source : Finset A) (left right : A → ℚ)
  → 0 ≤ metric/finite-signed-sup-distance A source left right

0 = signed/zeroFinset = finset-data/Finsetℚ = signed/SignedRational≤ = signed/at-most

metric/finite-signed-sup-distance-symmetric

TheoremFor all inputsNo axiomsSource, line 177

metric/finite-signed-sup-distance-symmetric.{u} :
  (A : Type u) (source : Finset A) (left right : A → ℚ)
  → distance left right = distance right left
  where distance := metric/finite-signed-sup-distance A source

= = signed/equivalent: equality of rational valuesFinset = finset-data/Finsetℚ = signed/SignedRational

metric/finite-signed-sup-distance-triangle

TheoremFor all inputsNo axiomsSource, line 214

metric/finite-signed-sup-distance-triangle.{u} :
  (A : Type u) (source : Finset A) (left middle right : A → ℚ)
  → distance right ≤ distance middle + metric/finite-signed-sup-distance A source middle right
  where distance := metric/finite-signed-sup-distance A source left

+ = signed/addFinset = finset-data/Finsetℚ = signed/SignedRational≤ = signed/at-most