Jump to content

Talk:Determinant

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

Right handed coordinante[edit]

the following sentence is not clear. "The determinant of a set of vectors is positive if the vectors form a right-handed coordinate system, and negative if left-handed." what does "right-handed coordinate system" means? the "coordinate system" article does not mention it. amit man

Possible to do/see also items[edit]

linear algebra/analytic geometry[edit]

linear independence/collinearity, Gram determinant, tensor, positive definite matrix (Sylvester's criterion), defining a plane, Line-line intersection, Cayley–Hamilton_theorem, cross product, Matrix representation of conic sections, adjugate matrix, similar matrix have same det (Similarity invariance), Cauchy–Binet formula, Trilinear_coordinates, Trace diagram, Pfaffian

types of matrices[edit]

special linear group, special orthogonal group, special unitary group, indefinite special orthogonal group, modular group, unimodular matrix, matrices with multidimensional indices

number theory/algebra[edit]

Pell's equation/continued fraction?, discriminant, Minkowski's theorem/lattice, Partition_(number_theory), resultant, field norm, Dirichlet's_unit_theorem, discriminant of an algebraic number field

geometry, analysis[edit]

conformal map?, Gauss curvature, orientability, Integration by substitution, Wronskian, invariant theory, Monge–Ampère equation, Brascamp–Lieb_inequality, Liouville's formula, absolute value of cx numbers and quaternions (see 3-sphere), distance geometry (Cayley–Menger determinant), Delaunay_triangulation

open questions[edit]

Jacobian conjecture, Hadamard's maximal determinant problem

algorithms[edit]

polar decomposition, QR decomposition, Dodgson_condensation, Matrix_determinant_lemma, eigendecomposition a few papers: Monte carlo for sparse matrices, approximation of det of large matrices, The Permutation Algorithm for Non-Sparse Matrix Determinant in Symbolic Computation, DETERMINANT APPROXIMATIONS

examples[edit]

reflection matrix, Rotation matrix, Vandermonde matrix, Circulant matrix, Hessian matrix (Blob_detection#The_determinant_of_the_Hessian), block matrix, Gram determinant, Elementary_matrix, Orr–Sommerfeld_equation, det of Cartan matrix

generalizations[edit]

Hyperdeterminant, Quasideterminant, Continuant (mathematics), Immanant of a matrix, permanent, Pseudo-determinant, det's of infinite matrices / regularized det / functional determinant (see also operator theory), Fredholm determinant, superdeterminant

other[edit]

Determinantal point process, Kirchhoff's theorem,

books[edit]

[1]

Precise definition in the introduction?[edit]

Sorry for having attempted this substantial edit without prior discussion! My main desire is to add to the introduction at least one definition that is uniquely true of the determinant.

Right now, the introduction doesn't define the determinant, though precise definitions do exist. Instead it just makes some statements which are true of many objects:

- It is a scalar function of a square matrix

- It characterizes some properties of that matrix. (This is a bit vague and contentless)

- It is nonzero only on invertible matrices and distributes over matrix multiplication (also true of any multiplicative function of the determinant, such as the square)

Can I lobby for at least one crisp, technical, honest-to-goodness *definition* of the determinant? For example, "the determinant is the product of the full set of complex eigenvalues of a matrix, with multiplicity." What do you think? Cooljeff3000 (talk) 12:09, 2 July 2024 (UTC)[reply]

As you need the determinant for defining "the full set of complex eigenvalues of a matrix, with multiplicity", such a circular definition does not belong to the lead. By WP:TECHNICAL, a definition is convenient for a lead only if it can be understood by non-specialists.
The less technical definition of a determinant that I know is the following: The determinant is the unique function of the coefficients of a square matrix such that the determinant of a product of matrices is the product of their determinants, and the determinant of a triangular matrix is the product of its diagonal entries.
This definition uses implicitely the fact the every matrix is similar to a triangular matrix. As these diagonal entries are clearly the eigenvalues of the initial matrix, your definition is immediately implied.
Personally, I do not find that this definition is convenient for the lead, as there are many other equivalent definitions, and this equivalence clearly does not belong to the lead.
So the best thing seems to not chnge the structure of the lead. D.Lazard (talk) 13:16, 2 July 2024 (UTC)[reply]
Finally, the determinant is completely characterized by the fact that the determinant of a product of matrices is the product of the determinants and that the detrminant of a triangular matrix is the product of its diagonal entries. I have added this, with a footnote explaining that this results from Gaussian elimination. D.Lazard (talk) 18:12, 2 July 2024 (UTC)[reply]
The Gaussian elimination section seems redundant with the following section, since it is essentially equivalent to LU decomposition of the matrix. –jacobolus (t) 20:00, 2 July 2024 (UTC)[reply]

Please write in English (if for the English Wikipedia)[edit]

The section Sum contains this passage:

"Conversely, if and are Hermitian, positive-definite, and size , then the determinant has concave th root;"

This statement makes no sense in either English or mathematics.

I hope that someone knowledgeable about this subject will fix this.

— Preceding unsigned comment added by 2601:204:f181:9410:d8dc:6178:320e:f4d5 (talk) 01:11, 3 July 2024 (UTC)[reply]

I have fixed the paragraph. D.Lazard (talk) 09:04, 3 July 2024 (UTC)[reply]