Jump to content

Main menu Navigation ●Main page ●Contents ●Current events ●Random article ●About Wikipedia ●Contact us ●Donate Contribute ●Help ●Learn to edit ●Community portal ●Recent changes ●Upload file

●Create account ●Log in ●Create account ● Log in Pages for logged out editors learn more ●Contributions ●Talk

(Top) 1 Definition 2 Properties 3 Construction 4 Variants 5 See also 6 References 7 External links

Pascal matrix

●Français ●한국어 ●Italiano ●Русский ●Svenska ●中文 Edit links ●Article ●Talk ●Read ●Edit ●View history Tools Actions ●Read ●Edit ●View history General ●What links here ●Related changes ●Upload file ●Special pages ●Permanent link ●Page information ●Cite this page ●Get shortened URL ●Download QR code ●Wikidata item Print/export ●Download as PDF ●Printable version Appearance From Wikipedia, the free encyclopedia

Inmathematics, particularly matrix theory and combinatorics, a Pascal matrix is a matrix (possibly infinite) containing the binomial coefficients as its elements. It is thus an encoding of Pascal's triangle in matrix form. There are three natural ways to achieve this: as a lower-triangular matrix, an upper-triangular matrix, or a symmetric matrix. For example, the 5 × 5 matrices are:

L_{5}={\begin{pmatrix}1&0&0&0&0\\1&1&0&0&0\\1&2&1&0&0\\1&3&3&1&0\\1&4&6&4&1\end{pmatrix}}\,\,\,

L_{5}={\begin{pmatrix}1&0&0&0&0\\1&1&0&0&0\\1&2&1&0&0\\1&3&3&1&0\\1&4&6&4&1\end{pmatrix}}\,\,\,

U_{5}={\begin{pmatrix}1&1&1&1&1\\0&1&2&3&4\\0&0&1&3&6\\0&0&0&1&4\\0&0&0&0&1\end{pmatrix}}\,\,\,

U_{5}={\begin{pmatrix}1&1&1&1&1\\0&1&2&3&4\\0&0&1&3&6\\0&0&0&1&4\\0&0&0&0&1\end{pmatrix}}\,\,\,

S_{5}={\begin{pmatrix}1&1&1&1&1\\1&2&3&4&5\\1&3&6&10&15\\1&4&10&20&35\\1&5&15&35&70\end{pmatrix}}=L_{5}\times U_{5}

S_{5}={\begin{pmatrix}1&1&1&1&1\\1&2&3&4&5\\1&3&6&10&15\\1&4&10&20&35\\1&5&15&35&70\end{pmatrix}}=L_{5}\times U_{5}

There are other ways in which Pascal's triangle can be put into matrix form, but these are not easily extended to infinity.^[1]

Definition[edit]

The non-zero elements of a Pascal matrix are given by the binomial coefficients:

L_{ij}={i \choose j}={\frac {i!}{j!(i-j)!}},j\leq i

L_{ij}={i \choose j}={\frac {i!}{j!(i-j)!}},j\leq i

U_{ij}={j \choose i}={\frac {j!}{i!(j-i)!}},i\leq j

U_{ij}={j \choose i}={\frac {j!}{i!(j-i)!}},i\leq j

S_{ij}={i+j \choose i}={i+j \choose j}={\frac {(i+j)!}{i!j!}}

S_{ij}={i+j \choose i}={i+j \choose j}={\frac {(i+j)!}{i!j!}}

such that the indices i, j start at 0, and ! denotes the factorial.

Properties[edit]

The matrices have the pleasing relationship S_n = L_nU_n. From this it is easily seen that all three matrices have determinant 1, as the determinant of a triangular matrix is simply the product of its diagonal elements, which are all 1 for both L_n and U_n. In other words, matrices S_n, L_n, and U_n are unimodular, with L_n and U_n having trace n.

The trace of S_n is given by

{\text{tr}}(S_{n})=\sum _{i=1}^{n}{\frac {[2(i-1)]!}{[(i-1)!]^{2}}}=\sum _{k=0}^{n-1}{\frac {(2k)!}{(k!)^{2}}}

with the first few terms given by the sequence 1, 3, 9, 29, 99, 351, 1275, ... (sequence A006134 in the OEIS).

Construction[edit]

A Pascal matrix can actually be constructed by taking the matrix exponential of a special subdiagonalorsuperdiagonal matrix. The example below constructs a 7 × 7 Pascal matrix, but the method works for any desired n × n Pascal matrices. The dots in the following matrices represent zero elements.

{\begin{array}{lll}&L_{7}=\exp \left(\left[{\begin{smallmatrix}.&.&.&.&.&.&.\\1&.&.&.&.&.&.\\.&2&.&.&.&.&.\\.&.&3&.&.&.&.\\.&.&.&4&.&.&.\\.&.&.&.&5&.&.\\.&.&.&.&.&6&.\end{smallmatrix}}\right]\right)=\left[{\begin{smallmatrix}1&.&.&.&.&.&.\\1&1&.&.&.&.&.\\1&2&1&.&.&.&.\\1&3&3&1&.&.&.\\1&4&6&4&1&.&.\\1&5&10&10&5&1&.\\1&6&15&20&15&6&1\end{smallmatrix}}\right];\quad \\\\&U_{7}=\exp \left(\left[{\begin{smallmatrix}{\color {white}1}.&1&.&.&.&.&.\\{\color {white}1}.&.&2&.&.&.&.\\{\color {white}1}.&.&.&3&.&.&.\\{\color {white}1}.&.&.&.&4&.&.\\{\color {white}1}.&.&.&.&.&5&.\\{\color {white}1}.&.&.&.&.&.&6\\{\color {white}1}.&.&.&.&.&.&.\end{smallmatrix}}\right]\right)=\left[{\begin{smallmatrix}1&1&1&1&1&1&1\\.&1&2&3&4&5&6\\.&.&1&3&6&10&15\\.&.&.&1&4&10&20\\.&.&.&.&1&5&15\\.&.&.&.&.&1&6\\.&.&.&.&.&.&1\end{smallmatrix}}\right];\\\\\therefore &S_{7}=\exp \left(\left[{\begin{smallmatrix}.&.&.&.&.&.&.\\1&.&.&.&.&.&.\\.&2&.&.&.&.&.\\.&.&3&.&.&.&.\\.&.&.&4&.&.&.\\.&.&.&.&5&.&.\\.&.&.&.&.&6&.\end{smallmatrix}}\right]\right)\exp \left(\left[{\begin{smallmatrix}{\color {white}i}.&1&.&.&.&.&.\\{\color {white}i}.&.&2&.&.&.&.\\{\color {white}i}.&.&.&3&.&.&.\\{\color {white}i}.&.&.&.&4&.&.\\{\color {white}i}.&.&.&.&.&5&.\\{\color {white}i}.&.&.&.&.&.&6\\{\color {white}i}.&.&.&.&.&.&.\end{smallmatrix}}\right]\right)=\left[{\begin{smallmatrix}1&1&1&1&1&1&1\\1&2&3&4&5&6&7\\1&3&6&10&15&21&28\\1&4&10&20&35&56&84\\1&5&15&35&70&126&210\\1&6&21&56&126&252&462\\1&7&28&84&210&462&924\end{smallmatrix}}\right].\end{array}}

It is important to note that one cannot simply assume exp(A) exp(B) = exp(A + B), for n × n matrices A and B; this equality is only true when AB = BA (i.e. when the matrices A and B commute). In the construction of symmetric Pascal matrices like that above, the sub- and superdiagonal matrices do not commute, so the (perhaps) tempting simplification involving the addition of the matrices cannot be made.

A useful property of the sub- and superdiagonal matrices used for the construction is that both are nilpotent; that is, when raised to a sufficiently great integer power, they degenerate into the zero matrix. (See shift matrix for further details.) As the n × n generalised shift matrices we are using become zero when raised to power n, when calculating the matrix exponential we need only consider the first n + 1 terms of the infinite series to obtain an exact result.

Variants[edit]

Interesting variants can be obtained by obvious modification of the matrix-logarithm PL₇ and then application of the matrix exponential.

The first example below uses the squares of the values of the log-matrix and constructs a 7 × 7 "Laguerre"- matrix (or matrix of coefficients of Laguerre polynomials

{\begin{array}{lll}&LAG_{7}=\exp \left(\left[{\begin{smallmatrix}.&.&.&.&.&.&.\\1&.&.&.&.&.&.\\.&4&.&.&.&.&.\\.&.&9&.&.&.&.\\.&.&.&16&.&.&.\\.&.&.&.&25&.&.\\.&.&.&.&.&36&.\end{smallmatrix}}\right]\right)=\left[{\begin{smallmatrix}1&.&.&.&.&.&.\\1&1&.&.&.&.&.\\2&4&1&.&.&.&.\\6&18&9&1&.&.&.\\24&96&72&16&1&.&.\\120&600&600&200&25&1&.\\720&4320&5400&2400&450&36&1\end{smallmatrix}}\right];\quad \end{array}}

The Laguerre-matrix is actually used with some other scaling and/or the scheme of alternating signs. (Literature about generalizations to higher powers is not found yet)

The second example below uses the products v(v + 1) of the values of the log-matrix and constructs a 7 × 7 "Lah"- matrix (or matrix of coefficients of Lah numbers)

{\begin{array}{lll}&LAH_{7}=\exp \left(\left[{\begin{smallmatrix}.&.&.&.&.&.&.\\2&.&.&.&.&.&.\\.&6&.&.&.&.&.\\.&.&12&.&.&.&.\\.&.&.&20&.&.&.\\.&.&.&.&30&.&.\\.&.&.&.&.&42&.\end{smallmatrix}}\right]\right)=\left[{\begin{smallmatrix}1&.&.&.&.&.&.&.\\2&1&.&.&.&.&.&.\\6&6&1&.&.&.&.&.\\24&36&12&1&.&.&.&.\\120&240&120&20&1&.&.&.\\720&1800&1200&300&30&1&.&.\\5040&15120&12600&4200&630&42&1&.\\40320&141120&141120&58800&11760&1176&56&1\end{smallmatrix}}\right];\quad \end{array}}

Using v(v − 1) instead provides a diagonal shifting to bottom-right.

The third example below uses the square of the original PL₇-matrix, divided by 2, in other words: the first-order binomials (binomial(k, 2)) in the second subdiagonal and constructs a matrix, which occurs in context of the derivatives and integrals of the Gaussian error function:

{\begin{array}{lll}&GS_{7}=\exp \left(\left[{\begin{smallmatrix}.&.&.&.&.&.&.\\.&.&.&.&.&.&.\\1&.&.&.&.&.&.\\.&3&.&.&.&.&.\\.&.&6&.&.&.&.\\.&.&.&10&.&.&.\\.&.&.&.&15&.&.\end{smallmatrix}}\right]\right)=\left[{\begin{smallmatrix}1&.&.&.&.&.&.\\.&1&.&.&.&.&.\\1&.&1&.&.&.&.\\.&3&.&1&.&.&.\\3&.&6&.&1&.&.\\.&15&.&10&.&1&.\\15&.&45&.&15&.&1\end{smallmatrix}}\right];\quad \end{array}}

If this matrix is inverted (using, for instance, the negative matrix-logarithm), then this matrix has alternating signs and gives the coefficients of the derivatives (and by extension the integrals) of Gauss' error-function. (Literature about generalizations to greater powers is not found yet.)

Another variant can be obtained by extending the original matrix to negative values:

{\begin{array}{lll}&\exp \left(\left[{\begin{smallmatrix}.&.&.&.&.&.&.&.&.&.&.&.\\-5&.&.&.&.&.&.&.&.&.&.&.\\.&-4&.&.&.&.&.&.&.&.&.&.\\.&.&-3&.&.&.&.&.&.&.&.&.\\.&.&.&-2&.&.&.&.&.&.&.&.\\.&.&.&.&-1&.&.&.&.&.&.&.\\.&.&.&.&.&0&.&.&.&.&.&.\\.&.&.&.&.&.&1&.&.&.&.&.\\.&.&.&.&.&.&.&2&.&.&.&.\\.&.&.&.&.&.&.&.&3&.&.&.\\.&.&.&.&.&.&.&.&.&4&.&.\\.&.&.&.&.&.&.&.&.&.&5&.\end{smallmatrix}}\right]\right)=\left[{\begin{smallmatrix}1&.&.&.&.&.&.&.&.&.&.&.\\-5&1&.&.&.&.&.&.&.&.&.&.\\10&-4&1&.&.&.&.&.&.&.&.&.\\-10&6&-3&1&.&.&.&.&.&.&.&.\\5&-4&3&-2&1&.&.&.&.&.&.&.\\-1&1&-1&1&-1&1&.&.&.&.&.&.\\.&.&.&.&.&0&1&.&.&.&.&.\\.&.&.&.&.&.&1&1&.&.&.&.\\.&.&.&.&.&.&1&2&1&.&.&.\\.&.&.&.&.&.&1&3&3&1&.&.\\.&.&.&.&.&.&1&4&6&4&1&.\\.&.&.&.&.&.&1&5&10&10&5&1\end{smallmatrix}}\right].\end{array}}

References[edit]

^ Birregah, Babiga; Doh, Prosper K.; Adjallah, Kondo H. (2010-07-01). "A systematic approach to matrix forms of the Pascal triangle: The twelve triangular matrix forms and relations". European Journal of Combinatorics. 31 (5): 1205–1216. doi:10.1016/j.ejc.2009.10.009. ISSN 0195-6698.

G. S. Call and D. J. Velleman, "Pascal's matrices", American Mathematical Monthly, volume 100, (April 1993) pages 372–376
Edelman, Alan; Strang, Gilbert (March 2004), "Pascal Matrices" (PDF), American Mathematical Monthly, 111 (3): 361–385, doi:10.2307/4145127, JSTOR 4145127, archived from the original (PDF) on 2010-07-04

External links[edit]

G. Helms Pascalmatrix in a project of compilation of facts about Numbertheoretical matrices
G. Helms Gauss-matrix
Weisstein, Eric W. Gaussian-function
Weisstein, Eric W. Erf-function
Weisstein, Eric W. "Hermite Polynomial". Hermite-polynomials
Endl, Kurt "Über eine ausgezeichnete Eigenschaft der Koeffizientenmatrizen des Laguerreschen und des Hermiteschen Polynomsystems". In: PERIODICAL VOLUME 65 Mathematische Zeitschrift Kurt Endl
OEIS sequence A066325 (Coefficients of unitary Hermite polynomials He_n(x)) (Related to Gauss-matrix).

v t e Matrix classes
Explicitly constrained entries	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
Constant	Exchange Hilbert Identity Lehmer Of ones Pascal Pauli Redheffer Shift Zero
Conditions on eigenvalues or eigenvectors	Companion Convergent Defective Definite Diagonalizable Hurwitz Positive-definite Stieltjes
Satisfying conditions on productsorinverses	Congruent IdempotentorProjection Invertible Involutory Nilpotent Normal Orthogonal Unimodular Unipotent Unitary Totally unimodular Weighing
With specific applications	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
Used in statistics	Centering Correlation Covariance Design Doubly stochastic Fisher information Hat Precision Stochastic Transition
Used in graph theory	Adjacency Biadjacency Degree Edmonds Incidence Laplacian Seidel adjacency Tutte
Used in science and engineering	Cabibbo–Kobayashi–Maskawa Density Fundamental (computer vision) Fuzzy associative Gamma Gell-Mann Hamiltonian Irregular Overlap S State transition Substitution Z (chemistry)
Related terms	Jordan normal form Linear independence Matrix exponential Matrix representation of conic sections Perfect matrix Pseudoinverse Row echelon form Wronskian
Mathematics portal List of matrices Category:Matrices

Retrieved from "https://en.wikipedia.org/w/index.php?title=Pascal_matrix&oldid=1190406505" Categories: ●Matrices ●Triangles of numbers Hidden categories: ●Articles with short description ●Short description matches Wikidata ●Use American English from January 2019 ●All Wikipedia articles written in American English ●This page was last edited on 17 December 2023, at 18:32 (UTC). ●Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. ●Privacy policy ●About Wikipedia ●Disclaimers ●Contact Wikipedia ●Code of Conduct ●Developers ●Statistics ●Cookie statement ●Mobile view