Solving a 4x4 Determinant for Math Projects

  • Thread starter Thread starter jebeagles
  • Start date Start date
  • Tags Tags
    Determinant
jebeagles
I was doing a math project, and I was wondering if anyone knew how to solve a 4x4 determinant.
 
Physics news on Phys.org
Convert it to it's upper triangular form using Gaussian Elimination and the determinant should be the product of it's diagonal elements. I think.
 
Aplying the permutation definition, you will have 24 terms to sum. Its much easier to do by minors.
 
The DEFINITION of a genereal n by n determinant is this: form all possible products taking one number from each row and column. There will be n! ways to do this. If you write the terms so that the numbers are in order of the columns, the row numbers will be a permutation of 1,2,3...n. Multiply each product by -1 if this is an odd permutation, 1 if even permutation, and add.

The simplest way to calculate it is row reduce as Jhageb suggested.

Second simplest way is to "expand by minors".
 

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
View full post »

Thread 'Decomposition into irreps of compact Lie group'

When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
View full post »

Similar threads

I Solving matrix commutator equations?
Replies
7
Views
3K
I Matrix rank in terms of determinant polynomial
Replies
14
Views
3K
I Finding the Matrix O for a 4x4 Operator Acting on a 4x1 Vector
Replies
1
Views
933
MHB 4x4 Matrix with rank B=4 and B^2=3
Replies
7
Views
3K
I A question I have about my L.A. textbook (2)
Replies
6
Views
2K
B What unique contributions to math did linear algebra make?
Replies
19
Views
3K
A Similarity transformation changing the determinant to 1
Replies
20
Views
3K
I Fundamental matrix of a second order 2x2 system of ODEs
Replies
2
Views
4K
I Can You Use the Appended Matrix Method for 4x4 Determinants?
Replies
1
Views
1K
MHB Determinants and Rank: Solving for det(A) Given Rank(A)=4
Replies
1
Views
1K

Hot Threads

Recent Insights

Back
Top