Understanding and Calculating Matrix Determinants - Step by Step Guide

encomes
Messages
4
Reaction score
0
How can I get the determinant of this matrix?

1-n 1 ...1 1
1 1-n ...1 1
. . . .
. . . .
1 1 ... 1 1-n

I think that the answer is 0 but... why?

Thank you.
 
Physics news on Phys.org
encomes said:
How can I get the determinant of this matrix?

1-n 1 ...1 1
1 1-n ...1 1
. . . .
. . . .
1 1 ... 1 1-n

I think that the answer is 0 but... why?

Thank you.
Is "n" here the order of the matrix? If so then, by a row reduction to diagonal or triangular form, you can show that the last row becomes all "0"s.
 
Last edited by a moderator:
Thx for your reply, but I can't see how u get to this solution.. Can u show me the process?
Thanks again!
 
Try this: add all of the other rows to the first row. What do you get?

(Try it with n= 2, 3, and 4 first.)
 
Alright, so, if I have a determinant with n=4, i add all the rows to the first and i get (4-n +4-n +4-n +4-n), so, it's 0.

Is there any other process?

Thank you.
 

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 Matrix rank in terms of determinant polynomial
Replies
14
Views
3K
I Can I visualize O(3) \ SO(3) in some way?
Replies
4
Views
3K
A Similarity transformation changing the determinant to 1
Replies
20
Views
3K
I Can one find a matrix that's 'unique' to a collection of eigenvectors?
Replies
33
Views
670
I About writing a unitary matrix in another way
Replies
3
Views
2K
I Determinant of a specific, symmetric Toeplitz matrix
Replies
1
Views
2K
I Matrix representation for closed-form expression for Fibonacci numbers
Replies
2
Views
1K
I Proof about a positive definite matrix
Replies
12
Views
2K
I Want to understand how to express the derivative as a matrix
Replies
8
Views
2K
I Uniqueness of reduced row echelon form (proof verification)
Replies
4
Views
1K

Hot Threads

Recent Insights

Back
Top