Dashboard

Featured nodes

Roots

  • Public root

Templates

  • Test template
  • iCorps template
  • Guanyu's Latex template
  • Ivar's latex template
  • Family Tree template
  • Latex template
  • Router template

Trees

  • Public trees

Orphans

  • Browse orphan nodes
Related nodes

Parents1

  • Matrix equivalence

Siblings4
  • Sort by title
  • Sort by date

  • Definition of equivalent matrices
  • Equivalent matrices represent the same linear transformation with resect to appropriate bases.
  • A matrix of rank k is equivalent to a matrix with 1 in the first k diagonal entries and 0 elsewhere.
  • Two matrices of the same size are equivalent if and only if they have the same rank.
Knowenβ
  • Help
    • Welcome to Knowen!
    • Edit test node (no login required)
    • Create new test node (no login required)
  • Not logged in
    • Sign in
    • Sign up

History & Comments

Back

Fill content

Description:Added definition of equivalent matrices
# Definition of equivalent matrices

Put content here**Definition:** Two $m \times n$ matrices $A$ and $B$ are **equivalent** if there exist invertible matrices $P$ ($m \times m$) and $Q$ ($n \times n$) such that:
⏎
$$B = PAQ$$
⏎
**Interpretation:** $P$ represents a change of basis in the codomain and $Q$ represents a change of basis in the domain. Equivalent matrices represent the same linear transformation $T: V \to W$ with respect to different choices of bases.
⏎
**Properties:**
- Reflexive: $A = I \cdot A \cdot I$
- Symmetric: if $B = PAQ$ then $A = P^{-1}BQ^{-1}$
- Transitive: if $B = PAQ$ and $C = RB S$, then $C = (RP)A(SQ)$
⏎
Equivalence is coarser than similarity (which requires $Q = P^{-1}$ and only applies to square matrices).

# Parents

* Matrix equivalence
Sign in to add a new comment

Contact us or leave feedback

© KTree Inc. 2026