Documentation

Mathlib.LinearAlgebra.Matrix.Symmetrizable

Symmetrizable Matrices #

A matrix M is symmetrizable if there exists a diagonal matrix D such that D * M is symmetric. If furthermore the diagonal entries of D are positive, M is said to be positively symmetrizable.

def Matrix.IsSymmetrizable {ι : Type u_1} {R : Type u_3} [MonoidWithZero R] (M : Matrix ι ι R) :

A matrix is symmetrizable if it is symmetric when multiplied by a diagonal matrix of diagonal entries that do not divide zero.

Equations
Instances For
    theorem Matrix.IsSymmetrizable.of_isEmpty {ι : Type u_1} {R : Type u_3} {M : Matrix ι ι R} [Semiring R] [IsEmpty ι] :
    theorem Matrix.IsSymm.isSymmetrizable {ι : Type u_1} {R : Type u_3} {M : Matrix ι ι R} [MonoidWithZero R] (h : M.IsSymm) :
    theorem Matrix.isSymmetrizable_iff {ι : Type u_1} {R : Type u_3} {M : Matrix ι ι R} [DecidableEq ι] [Fintype ι] [Semiring R] :
    M.IsSymmetrizable ↔ ∃ (d : ι → R), (∀ (i : ι), d i ∈ nonZeroDivisors R) ∧ (diagonal d * M).IsSymm
    theorem Matrix.isSymmetrizable_iff' {ι : Type u_1} {R : Type u_3} [Field R] [DecidableEq ι] [Fintype ι] (M : Matrix ι ι R) :
    M.IsSymmetrizable ↔ ∃ (d : ι → R), IsUnit (diagonal d) ∧ (diagonal d * M).IsSymm
    theorem Matrix.IsSymmetrizable.submatrix {ι : Type u_1} {κ : Type u_2} {R : Type u_3} {M : Matrix ι ι R} [MonoidWithZero R] (f : κ → ι) (h : M.IsSymmetrizable) :
    theorem Matrix.IsSymmetrizable.apply_eq_zero_iff {ι : Type u_1} {R : Type u_3} {M : Matrix ι ι R} [MonoidWithZero R] (h : M.IsSymmetrizable) {i j : ι} :
    M i j = 0 ↔ M j i = 0
    theorem Matrix.isSymmetrizable_iff_of_pairwise_eq {ι : Type u_1} {R : Type u_3} {M N : Matrix ι ι R} [MonoidWithZero R] (h : Pairwise fun (i j : ι) => M i j = N i j) :
    @[simp]
    theorem Matrix.isSymmetrizable_add_diagonal_iff {ι : Type u_1} {R : Type u_3} {M : Matrix ι ι R} [DecidableEq ι] [Semiring R] (d : ι → R) :
    def Matrix.IsPosSymmetrizable {ι : Type u_1} {R : Type u_3} [Semiring R] [LT R] (M : Matrix ι ι R) :

    A matrix is positively symmetrizable if it is symmetric when multiplied by a diagonal matrix of positive diagonal entries.

    Equations
    Instances For
      theorem Matrix.IsPosSymmetrizable.of_isEmpty {ι : Type u_1} {R : Type u_3} {M : Matrix ι ι R} [Semiring R] [LT R] [IsEmpty ι] :
      theorem Matrix.IsSymm.isPosSymmetrizable {ι : Type u_1} {R : Type u_3} {M : Matrix ι ι R} [Semiring R] [IsDomain R] [PartialOrder R] [ZeroLEOneClass R] (h : M.IsSymm) :
      theorem Matrix.isPosSymmetrizable_iff {ι : Type u_1} {R : Type u_3} {M : Matrix ι ι R} [DecidableEq ι] [Fintype ι] [Semiring R] [LT R] :
      M.IsPosSymmetrizable ↔ ∃ (d : ι → R), (∀ (i : ι), 0 < d i) ∧ (diagonal d * M).IsSymm
      theorem Matrix.IsPosSymmetrizable.submatrix {ι : Type u_1} {κ : Type u_2} {R : Type u_3} {M : Matrix ι ι R} [Semiring R] [Preorder R] (f : κ → ι) (h : M.IsPosSymmetrizable) :
      theorem Matrix.isPosSymmetrizable_iff_of_pairwise_eq {ι : Type u_1} {R : Type u_3} {M N : Matrix ι ι R} [Semiring R] [LT R] (h : Pairwise fun (i j : ι) => M i j = N i j) :
      @[simp]
      theorem Matrix.isPosSymmetrizable_add_diagonal_iff {ι : Type u_1} {R : Type u_3} {M : Matrix ι ι R} [DecidableEq ι] [Semiring R] [LT R] (d : ι → R) :
      theorem Matrix.IsPosSymmetrizable.mk_of_forall_ne {ι : Type u_1} {R : Type u_3} {M : Matrix ι ι R} {k : ι} [Semiring R] [PartialOrder R] [IsStrictOrderedRing R] (e : ι → R) (he : ∀ (i : ι), 0 < e i) (hE : ∀ (i : ι), i ≠ k → ∀ (j : ι), j ≠ k → e i * M i j = e j * M j i) (h : ∃ a > 0, ∃ b > 0, ∀ (j : ι), j ≠ k → b * M k j = a * e j * M j k) :

      Extends positive symmetry from the complement of an index v to the full matrix, given a positive symmetry condition on the entries with v.