Jordan Normal Form Calculator
Calculate jordan normal form instantly with our math tool. Shows detailed work, formulas used, and multiple solution methods.
Calculator
Adjust values & calculateFormula
Where A is the original matrix, J is the Jordan normal form (block-diagonal with Jordan blocks), and P is the invertible matrix of generalized eigenvectors. Each Jordan block has an eigenvalue on the diagonal and ones on the superdiagonal.
Last reviewed: December 2025
Worked Examples
Example 1: Defective Matrix with Jordan Block
Example 2: Matrix Requiring a Jordan Block
Background & Theory
The Jordan Normal Form Calculator applies the following established principles and formulas. Mathematics rests on a hierarchy of number systems, each extending the previous. The natural numbers (1, 2, 3, ...) support counting and ordering. The integers add negative values and zero, enabling subtraction without restriction. The rational numbers, expressible as p/q where p and q are integers and q is nonzero, close the system under division. The real numbers fill the gaps left by irrationals such as the square root of 2 or pi, forming a complete ordered field. The complex numbers, written as a + bi where i is the square root of negative one, complete the algebraic closure of the reals and allow every polynomial to have a root. Prime factorization states that every integer greater than one is uniquely expressible as a product of primes, a result known as the Fundamental Theorem of Arithmetic. Computing the greatest common divisor (GCD) of two integers relies most efficiently on the Euclidean algorithm: repeatedly replace the larger number with the remainder when it is divided by the smaller, until the remainder is zero. The last nonzero remainder is the GCD. The least common multiple (LCM) follows from the identity LCM(a, b) = |a * b| / GCD(a, b). Modular arithmetic defines equivalence classes of integers that share the same remainder under division by a modulus n. Fermat's Little Theorem and Euler's Theorem arise from this structure and underpin modern cryptography. Logarithms are the inverses of exponential functions. If b raised to the power x equals y, then the logarithm base b of y equals x. The natural logarithm uses base e, approximately 2.71828. Combinatorics counts arrangements and selections. The number of ordered arrangements (permutations) of r objects from n distinct objects is nPr = n! / (n - r)!. The number of unordered selections (combinations) is nCr = n! / (r! * (n - r)!). Pascal's triangle arranges these binomial coefficients so that each entry equals the sum of the two entries directly above it. The Fibonacci sequence, defined by F(1) = 1, F(2) = 1, and F(n) = F(n-1) + F(n-2), appears throughout nature and connects deeply to the golden ratio via Binet's formula.
History
The history behind the Jordan Normal Form Calculator traces back through the following developments. Mathematics as a systematic discipline traces to ancient Mesopotamia. Babylonian clay tablets dating to around 1800 BCE demonstrate knowledge of quadratic equations, Pythagorean triples, and base-60 arithmetic, suggesting a practical mathematical tradition far preceding Greek formalism. Euclid of Alexandria compiled the Elements around 300 BCE, establishing the axiomatic method that would define rigorous mathematics for over two thousand years. His work organized plane geometry, number theory, and proportion into logically chained propositions derived from a small set of postulates. The algorithm bearing his name for computing GCDs appears in Book VII and remains in use today. In the 9th century, the Persian scholar Muhammad ibn Musa Al-Khwarizmi wrote Al-Kitab al-mukhtasar fi hisab al-jabr wal-muqabala, the treatise whose title gave algebra its name. He systematized the solution of linear and quadratic equations and described procedures that operated on unknowns as objects, a conceptual leap away from purely numerical calculation. Rene Descartes introduced coordinate geometry in 1637 by uniting algebra and Euclidean geometry, allowing curves to be studied through equations. This synthesis set the stage for calculus. Isaac Newton and Gottfried Wilhelm Leibniz independently developed calculus during the 1660s and 1670s, triggering a priority dispute that lasted decades and divided British and Continental mathematicians. Carl Friedrich Gauss proved the Fundamental Theorem of Algebra in 1799, showing that every nonconstant polynomial has at least one complex root. His Disquisitiones Arithmeticae of 1801 established modern number theory. David Hilbert's formalist program at the turn of the 20th century sought to place all of mathematics on an explicit axiomatic foundation, a project that Kurt Godel's incompleteness theorems of 1931 showed to be fundamentally limited. Alan Turing's work in the 1930s on computability introduced the theoretical model of the stored-program computer and linked mathematical logic directly to the limits of algorithmic calculation. His proof that no algorithm can decide in general whether an arbitrary program will halt or run forever placed fundamental boundaries on what mathematics can mechanically determine, and it opened the discipline now known as theoretical computer science.
Frequently Asked Questions
Formula
A = PJP^(-1), where J is the Jordan normal form
Where A is the original matrix, J is the Jordan normal form (block-diagonal with Jordan blocks), and P is the invertible matrix of generalized eigenvectors. Each Jordan block has an eigenvalue on the diagonal and ones on the superdiagonal.
Worked Examples
Example 1: Defective Matrix with Jordan Block
Problem: Find the Jordan normal form of A = [[5, 4], [-1, -3]] if it has a repeated eigenvalue.
Solution: Characteristic polynomial: lambda^2 - 2*lambda - 15 + 4 = lambda^2 - 2*lambda - 11\nWait, let me recalculate: det(A - lambda*I) = (5-lambda)(-3-lambda) - (4)(-1)\n= -15 + 3*lambda - 5*lambda + lambda^2 + 4\n= lambda^2 - 2*lambda - 11\nDiscriminant = 4 + 44 = 48 > 0\nlambda1 = (2 + 6.928) / 2 = 4.464\nlambda2 = (2 - 6.928) / 2 = -2.464\nDistinct eigenvalues: Jordan form is diagonal.
Result: J = diag(4.464, -2.464) | Matrix is diagonalizable with distinct eigenvalues
Example 2: Matrix Requiring a Jordan Block
Problem: Find the Jordan normal form of A = [[3, 1], [0, 3]].
Solution: Characteristic polynomial: (3-lambda)^2 = 0\nlambda = 3 (algebraic multiplicity 2)\nA - 3I = [[0, 1], [0, 0]]\nThis is NOT the zero matrix, so rank(A-3I) = 1\nGeometric multiplicity = 2 - 1 = 1\nSince geometric < algebraic, need Jordan block.\nJordan form: J = [[3, 1], [0, 3]]
Result: J = [[3, 1], [0, 3]] | Non-diagonalizable, requires 2x2 Jordan block
Frequently Asked Questions
What is the Jordan normal form of a matrix?
The Jordan normal form (also called Jordan canonical form) is a special block-diagonal matrix that is similar to the original matrix. Every square matrix over the complex numbers has a Jordan normal form, written as J = P^(-1)AP, where P is an invertible matrix of generalized eigenvectors. The Jordan form consists of Jordan blocks along the diagonal. Each Jordan block corresponds to an eigenvalue and has that eigenvalue on the diagonal, ones on the superdiagonal, and zeros elsewhere. The Jordan form reveals the complete algebraic structure of a linear transformation, including information that eigenvalues alone cannot convey, particularly about the behavior of repeated eigenvalues and defective matrices.
What is a Jordan block?
A Jordan block is a square matrix with a single eigenvalue lambda on the main diagonal, ones on the superdiagonal (the diagonal just above the main diagonal), and zeros everywhere else. A k-by-k Jordan block is written as J_k(lambda). For example, a 3x3 Jordan block for eigenvalue 2 is [[2,1,0],[0,2,1],[0,0,2]]. A 1x1 Jordan block is simply the eigenvalue itself, which is equivalent to a diagonal entry. When a matrix is diagonalizable, its Jordan form consists entirely of 1x1 Jordan blocks (making it a diagonal matrix). Non-diagonalizable matrices require larger Jordan blocks, which encode the deficiency in eigenvectors. The size and number of Jordan blocks determine the matrix exponential and the behavior of the associated dynamical system.
When is a matrix diagonalizable versus requiring Jordan blocks?
A matrix is diagonalizable if and only if for every eigenvalue, the geometric multiplicity (number of linearly independent eigenvectors) equals the algebraic multiplicity (multiplicity as a root of the characteristic polynomial). When these multiplicities differ, the matrix is defective and requires Jordan blocks larger than 1x1. For example, the matrix [[2,1],[0,2]] has eigenvalue 2 with algebraic multiplicity 2 but geometric multiplicity 1 (only one independent eigenvector), so its Jordan form is a single 2x2 Jordan block. In contrast, the identity matrix [[2,0],[0,2]] has the same eigenvalue with geometric multiplicity 2, making it already diagonal. The Jordan form uniquely characterizes this distinction.
How do you find the Jordan normal form of a 2x2 matrix?
For a 2x2 matrix, the process depends on the eigenvalues. If the two eigenvalues are distinct, the Jordan form is diagonal with the eigenvalues on the diagonal. If the eigenvalue is repeated (algebraic multiplicity 2), compute A - lambda*I. If this equals the zero matrix, the original matrix is already lambda*I (a scalar matrix), and the Jordan form is diagonal. If A - lambda*I is nonzero but has rank 1, the geometric multiplicity is 1, and the Jordan form is [[lambda, 1], [0, lambda]]. For complex eigenvalues a +/- bi, the real Jordan form uses 2x2 blocks [[a, b], [-b, a]]. Jordan Normal Form Calculator handles all three cases automatically and identifies which case applies.
How is the Jordan form used in solving systems of differential equations?
The Jordan form simplifies solving systems of linear ordinary differential equations of the form dx/dt = Ax. If A = PJP^(-1), then the substitution y = P^(-1)x transforms the system into dy/dt = Jy, which is much easier to solve because J is block-diagonal. For a diagonal Jordan form, each equation decouples: y_i(t) = c_i * e^(lambda_i * t). For a 2x2 Jordan block with eigenvalue lambda, the solution involves both e^(lambda*t) and t*e^(lambda*t), reflecting the polynomial growth that occurs with defective eigenvalues. This polynomial-times-exponential behavior explains why repeated eigenvalues with Jordan blocks can cause resonance phenomena in physical systems like coupled oscillators.
What is the relationship between Jordan form and matrix powers?
The Jordan form greatly simplifies computing matrix powers. Since A = PJP^(-1), we have A^n = PJ^nP^(-1). Powers of Jordan blocks follow a binomial-like pattern: the (i,j) entry of J_k(lambda)^n is C(n, j-i) * lambda^(n-j+i) when j >= i and 0 otherwise, where C(n,k) is the binomial coefficient. For a diagonal matrix, A^n simply raises each diagonal entry to the n-th power. For a 2x2 Jordan block, J^n = [[lambda^n, n*lambda^(n-1)], [0, lambda^n]]. This formula is essential in computing matrix exponentials, solving recurrence relations, analyzing Markov chains, and studying the long-term behavior of discrete dynamical systems.
References
Reviewed by Manoj Kumar, Mathematics Educator · Editorial policy