Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Smith normal form
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Definition== Let <math>A</math> be a nonzero <math>m \times n</math> matrix over a [[principal ideal domain]] <math>R</math>. There exist invertible <math>m \times m</math> and <math>n \times n</math>-matrices <math>S,T</math> (with entries in <math>R</math>) such that the product <math>SAT</math> is <math>\begin{pmatrix} \alpha_1 & 0 & 0 & \cdots & 0 & \cdots & 0 \\ 0 & \alpha_2 & 0 & & & & \\ 0 & 0 & \ddots & & \vdots & & \vdots\\ \vdots & & & \alpha_r & & & \\ 0 & & \cdots & & 0 & \cdots & 0 \\ \vdots & & & & \vdots & & \vdots \\ 0 & & \cdots & & 0 & \cdots & 0 \end{pmatrix}.</math> and the diagonal elements <math>\alpha_i</math> satisfy <math>\alpha_i \mid \alpha_{i+1}</math> for all <math>1 \le i < r</math>. This is the Smith normal form of the matrix <math>A</math>. The elements <math>\alpha_i</math> are unique [[up to]] multiplication by a [[unit (ring theory)|unit]] and are called the ''elementary divisors'', ''invariants'', or ''invariant factors''. They can be computed (up to multiplication by a unit) as : <math>\alpha_i = \frac{d_i(A)}{d_{i-1}(A)},</math> where <math>d_i(A)</math> (called ''i''-th ''determinant divisor'') equals the [[greatest common divisor]] of the determinants of all <math>i\times i</math> [[minor (linear algebra)|minor]]s of the matrix <math>A</math> and <math>d_0(A):=1</math>. '''Example :''' For a <math>2\times2</math> matrix, <math>{\rm SNF}{a~~b\choose c~~d} = {\rm diag}(d_1, d_2/d_1)</math> with <math>d_1 = \gcd(a,b,c,d)</math> and <math>d_2 = |ad-bc|</math>.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)