Matrix of ones
In mathematics, a matrix of ones or all-ones matrix has every entry equal to one.[1] Examples of standard notation are given below:
Some sources call the all-ones matrix the unit matrix,[2] but that term may also refer to the identity matrix, a different type of matrix.
A vector of ones or all-ones vector is matrix of ones having row or column form; it should not be confused with unit vectors.
Properties
For an n × n matrix of ones J, the following properties hold:
- The trace of J equals n,[3] and the determinant equals 0 for n ≥ 2, but equals 1 if n = 1.
- The characteristic polynomial of J is .
- The minimal polynomial of J is .
- The rank of J is 1 and the eigenvalues are n with multiplicity 1 and 0 with multiplicity n − 1.[4]
- for [5]
- J is the neutral element of the Hadamard product.[6]
When J is considered as a matrix over the real numbers, the following additional properties hold:
- J is positive semi-definite matrix.
- The matrix is idempotent.[5]
- The matrix exponential of J is
Applications
The all-ones matrix arises in the mathematical field of combinatorics, particularly involving the application of algebraic methods to graph theory. For example, if A is the adjacency matrix of an n-vertex undirected graph G, and J is the all-ones matrix of the same dimension, then G is a regular graph if and only if AJ = JA.[7] As a second example, the matrix appears in some linear-algebraic proofs of Cayley's formula, which gives the number of spanning trees of a complete graph, using the matrix tree theorem.
See also
- Zero matrix, a matrix where all entries are zero
- Single-entry matrix
References
- ^ Horn, Roger A.; Johnson, Charles R. (2012), "0.2.8 The all-ones matrix and vector", Matrix Analysis, Cambridge University Press, p. 8, ISBN 9780521839402.
- ^ Weisstein, Eric W. "Unit Matrix". MathWorld.
- ^ Stanley, Richard P. (2013), Algebraic Combinatorics: Walks, Trees, Tableaux, and More, Springer, Lemma 1.4, p. 4, ISBN 9781461469988.
- ^ Stanley (2013); Horn & Johnson (2012), p. 65.
- ^ a b Timm, Neil H. (2002), Applied Multivariate Analysis, Springer texts in statistics, Springer, p. 30, ISBN 9780387227719.
- ^ Smith, Jonathan D. H. (2011), Introduction to Abstract Algebra, CRC Press, p. 77, ISBN 9781420063721.
- ^ Godsil, Chris (1993), Algebraic Combinatorics, CRC Press, Lemma 4.1, p. 25, ISBN 9780412041310.
- v
- t
- e
- Alternant
- Anti-diagonal
- Anti-Hermitian
- Anti-symmetric
- Arrowhead
- Band
- Bidiagonal
- Bisymmetric
- Block-diagonal
- Block
- Block tridiagonal
- Boolean
- Cauchy
- Centrosymmetric
- Conference
- Complex Hadamard
- Copositive
- Diagonally dominant
- Diagonal
- Discrete Fourier Transform
- Elementary
- Equivalent
- Frobenius
- Generalized permutation
- Hadamard
- Hankel
- Hermitian
- Hessenberg
- Hollow
- Integer
- Logical
- Matrix unit
- Metzler
- Moore
- Nonnegative
- Pentadiagonal
- Permutation
- Persymmetric
- Polynomial
- Quaternionic
- Signature
- Skew-Hermitian
- Skew-symmetric
- Skyline
- Sparse
- Sylvester
- Symmetric
- Toeplitz
- Triangular
- Tridiagonal
- Vandermonde
- Walsh
- Z
- Adjugate
- Alternating sign
- Augmented
- Bézout
- Carleman
- Cartan
- Circulant
- Cofactor
- Commutation
- Confusion
- Coxeter
- Distance
- Duplication and elimination
- Euclidean distance
- Fundamental (linear differential equation)
- Generator
- Gram
- Hessian
- Householder
- Jacobian
- Moment
- Payoff
- Pick
- Random
- Rotation
- Seifert
- Shear
- Similarity
- Symplectic
- Totally positive
- Transformation
- Cabibbo–Kobayashi–Maskawa
- Density
- Fundamental (computer vision)
- Fuzzy associative
- Gamma
- Gell-Mann
- Hamiltonian
- Irregular
- Overlap
- S
- State transition
- Substitution
- Z (chemistry)
- Mathematics portal
- List of matrices
- Category:Matrices
This linear algebra-related article is a stub. You can help Wikipedia by expanding it. |
- v
- t
- e