Skip to content
Rainbow docs menu

Reference · Matrices

rainbow.math.linear.matrix.pointwise-order-laws

Matricessrc/rainbow/math/linear/matrix/pointwise_order_laws.clj0 definitions, 6 theorems

Partial-order and quotient-transport laws for native finite matrices. Matrix pointwise order is transitive, reversed by pointwise negation, and antisymmetric up to length-sensitive matrix equivalence. Matrix equivalence yields both order directions, and order endpoints may therefore be replaced by equivalent representatives. Dimension mismatches eliminate through the falsity branches of the reducible relation. Native and axiom-free on D63.

Depends onmath.linear.matrix.signed-scale-order

matrix/negate-reverses-order

TheoremFor all inputsNo axiomsSource, line 58

matrix/negate-reverses-order :
  (left right : List (List ℚ)) (ordered : matrix/at-most left right)
  → matrix/at-most (matrix/negate right) (matrix/negate left)

List = data/Listℚ = signed/SignedRational

matrix/at-most-transitive

TheoremFor all inputsNo axiomsSource, line 158

matrix/at-most-transitive :
  (left middle right : List (List ℚ)) (left-middle : matrix/at-most left middle)
  (middle-right : matrix/at-most middle right)
  → matrix/at-most left right

List = data/Listℚ = signed/SignedRational

matrix/at-most-antisymmetric

TheoremFor all inputsNo axiomsSource, line 334

matrix/at-most-antisymmetric :
  (left right : List (List ℚ)) (left-right : matrix/at-most left right)
  (right-left : matrix/at-most right left)
  → matrix/equivalent left right

List = data/Listℚ = signed/SignedRational

matrix/equivalent-to-mutual-at-most

TheoremFor all inputsNo axiomsSource, line 461

matrix/equivalent-to-mutual-at-most :
  (left right : List (List ℚ)) (same : matrix/equivalent left right)
  → proposition/conjunction (matrix/at-most left right) (matrix/at-most right left)

List = data/Listℚ = signed/SignedRational

matrix/equivalent-to-at-most

TheoremFor all inputsNo axiomsSource, line 610

matrix/equivalent-to-at-most :
  (left right : List (List ℚ)) (same : matrix/equivalent left right)
  → matrix/at-most left right

List = data/Listℚ = signed/SignedRational

matrix/at-most-respects-equivalence

TheoremFor all inputsNo axiomsSource, line 627

matrix/at-most-respects-equivalence :
  (left left* right right* : List (List ℚ)) (left-same : matrix/equivalent left left*)
  (right-same : matrix/equivalent right right*) (ordered : matrix/at-most left right)
  → matrix/at-most left* right*

List = data/Listℚ = signed/SignedRational