Skip to content
Rainbow docs menu

Reference · Matrices

rainbow.math.linear.matrix.additive-group

Matricessrc/rainbow/math/linear/matrix/additive_group.clj3 definitions, 8 theorems

Shaped zero, negation, subtraction, and inverse laws for matrices. The three operations map existing vector operations over rows (with subtraction defined by addition and negation). Zero and negation preserve complete matrix shape; same-shaped subtraction preserves both operand shapes. Matrix addition has shaped identities and inverses, including self-subtraction to the shaped zero matrix. Native and axiom-free on D63.

Depends onmath.linear.matrix.add-algebra

matrix/zero-like

DefinitionSource, line 69

matrix/zero-like :
  (x₁ : List (List ℚ))
  → List (List ℚ)

List = data/Listℚ = signed/SignedRational

matrix/negate

DefinitionSource, line 82

matrix/negate :
  (x₁ : List (List ℚ))
  → List (List ℚ)

List = data/Listℚ = signed/SignedRational

matrix/subtract

DefinitionSource, line 95

matrix/subtract :
  (x₁ x₂ : List (List ℚ))
  → List (List ℚ)

List = data/Listℚ = signed/SignedRational

matrix/zero-like-preserves-same-shape

TheoremFor all inputsNo axiomsSource, line 104

matrix/zero-like-preserves-same-shape :
  (rows : List (List ℚ))
  → matrix/same-shape (matrix/zero-like rows) rows

List = data/Listℚ = signed/SignedRational

matrix/negate-preserves-same-shape

TheoremFor all inputsNo axiomsSource, line 129

matrix/negate-preserves-same-shape :
  (rows : List (List ℚ))
  → matrix/same-shape (matrix/negate rows) rows

List = data/Listℚ = signed/SignedRational

matrix/subtract-preserves-shape

TheoremFor all inputsNo axiomsSource, line 154

matrix/subtract-preserves-shape :
  (left right : List (List ℚ)) (same : matrix/same-shape left right)
  → proposition/conjunction (shape₁) (shape)
  where shape := matrix/same-shape (matrix/subtract left right) right
  where shape₁ := matrix/same-shape (matrix/subtract left right) left

List = data/Listℚ = signed/SignedRational

matrix/add-zero-like-right

TheoremFor all inputsNo axiomsSource, line 199

matrix/add-zero-like-right :
  (rows : List (List ℚ))
  → matrix/equivalent (matrix/add rows (matrix/zero-like rows)) rows

List = data/Listℚ = signed/SignedRational

matrix/add-zero-like-left

TheoremFor all inputsNo axiomsSource, line 230

matrix/add-zero-like-left :
  (rows : List (List ℚ))
  → matrix/equivalent (matrix/add (matrix/zero-like rows) rows) rows

List = data/Listℚ = signed/SignedRational

matrix/add-negate-right-equivalent-zero-like

TheoremFor all inputsNo axiomsSource, line 249

matrix/add-negate-right-equivalent-zero-like :
  (rows : List (List ℚ))
  → matrix/equivalent (matrix/add rows (matrix/negate rows)) (matrix/zero-like rows)

List = data/Listℚ = signed/SignedRational

matrix/add-negate-left-equivalent-zero-like

TheoremFor all inputsNo axiomsSource, line 284

matrix/add-negate-left-equivalent-zero-like :
  (rows : List (List ℚ))
  → matrix/equivalent (matrix/add (matrix/negate rows) rows) (matrix/zero-like rows)

List = data/Listℚ = signed/SignedRational

matrix/subtract-self-equivalent-zero-like

TheoremFor all inputsNo axiomsSource, line 306

matrix/subtract-self-equivalent-zero-like :
  (rows : List (List ℚ))
  → matrix/equivalent (matrix/subtract rows rows) (matrix/zero-like rows)

List = data/Listℚ = signed/SignedRational