785 views

3 Answers

1 1 vote
$\Rightarrow $  Rank of  a matrix  is Non Zero Singular Values .

Proof- http://faculty.washington.edu/trogdon/105A/html/Lecture25.html

$\Rightarrow $ But here non zero eigen values are also given which means Full rank must be there .

From both of these we can Conclude that  No such Matrix exist. So option $C$ should be Ans.
edited by
0 0 votes
Assume matrix to be

$\begin{pmatrix} a &b \\ c&-a \end{pmatrix}$

"-a" because sum of trace is sum of eigenvaues which is zero

then determinant will be ${a^2}$+bc=1 (Product of eigenvalues)

then for symmetric values they are eigenvalues of ${A^T}$A doing that gives

$\begin{pmatrix} {a^2 + b^2} & ac-ab\\ ac-ab & {c^2+a^2} \end{pmatrix}$

Determinant of this will be 0

${(a^2+b^2)(c^2+a^2)-(ac-ab)^2=0}$

simplifing this will give ${(a^2 + bc)^2=0}$

which is a contradiction because that should be 1. Hence the answer is C

 
0 0 votes
Singular values = square root of eigen values , singular values are positive . If you take square root of -1 you get i which is not real positive. So such a matrix cannot exist
Position:
Show:

Related questions

1 1 vote
2 answers 2 answers
1.0k
1.0k views
harshrajhrj asked Apr 30, 2024
1,031 views
If the determinant and sum of eigen values of a 2 x 2 matrix are -1 and 0 then, what can you say about the rank of the given matrix?a) rank is 0b) rank is 1c) Insufficien...
2 2 votes
2 2 answers
1.5k
1.5k views
harshrajhrj asked Apr 30, 2024
1,524 views
Two fair 6-face diced are tossed independently. Let X be the random variable of the sum of two numbers on dices and let Y be the absolute difference of two numbers on dic...
0 0 votes
1 answers 1 answer
1.1k
1.1k views
SPluto asked May 2, 2019
1,076 views
Let L1 and L2 be 2 languages which are not regular. Which of these is true?The union of L1 and L2 is not regular.The intersection of L1 and L2 is not regular.Both I and I...
0 0 votes
0 0 answers
1.2k
1.2k views
SPluto asked May 2, 2019
1,235 views
Let SP be the problem of finding the shortest path between 2 nodes, and LP be the problem of finding the longest path between 2 nodes, in an unweighted, undirected graph....