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 canonical form for rank k matrix
# A matrix of rank k is equivalent to a matrix with 1 in the first k diagonal entries and 0 elsewhere.

Put content here**Theorem:** Every $m \times n$ matrix $A$ of rank $k$ is equivalent to the canonical form:
⏎
$$D_k = \begin{pmatrix} I_k & 0 \\ 0 & 0 \end{pmatrix}$$
⏎
where $I_k$ is the $k \times k$ identity matrix and all other entries are zero.
⏎
**Proof sketch:** By row and column operations (which correspond to left- and right-multiplication by invertible matrices), any matrix can be reduced to this form. This is essentially the result of Gauss-Jordan elimination extended to column operations.
⏎
**Example:** A $3 \times 4$ matrix of rank 2 is equivalent to:
$$\begin{pmatrix} 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 0 & 0 \end{pmatrix}$$
⏎
This canonical form shows that rank is the **only** invariant under matrix equivalence: two matrices are equivalent if and only if they have the same rank.

# Parents

* Matrix equivalence
Sign in to add a new comment

Contact us or leave feedback

© KTree Inc. 2026