MHB Linear Algebra and Determinant

Swati
Messages
16
Reaction score
0
1(a) Construct a 4*4 matrix whose determinant is easy to compute using cofactor expansion but hard to evaluate using elementary row operations.

(b) Construct a 4*4 matrix whose determinant is easy to compute using elementary row operations but hard to evaluate using cofactor expansion
 
Physics news on Phys.org
Swati said:
1(a) Construct a 4*4 matrix whose determinant is easy to compute using cofactor expansion but hard to evaluate using elementary row operations.

Would a matrix with all elements zero except for those on the diagonal which are a random sample of size 4 from U(0,1) qualify?

(b) Construct a 4*4 matrix whose determinant is easy to compute using elementary row operations but hard to evaluate using cofactor expansion

Would a matrix with two rows equal but with values samples from U(0,1), and all other values sampled independently from U(0,1) qualify?

CB
 
what is U(0,1) ?
Please explain me, i couldn't understand.
 
Swati said:
what is U(0,1) ?
Please explain me, i couldn't understand.

U(0,1) - the uniform distribution on [0,1). The suggestion is to use a random matrix generated in the specified way. In one case it would be diagonal, so the co-factor method would give the determinant as the product of the diagonal elements, in the second case with two equal rows row operations would deduce it has zero determinant.

CB
 
##\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...
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...
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...
Back
Top