MHB T20 Suppose that A is a square matrix of size n and ......

  • Thread starter Thread starter karush
  • Start date Start date
  • Tags Tags
    Matrix Square
karush
Gold Member
MHB
Messages
3,240
Reaction score
5
https://drive.google.com/file/d/1g7fjWAUEpOo2NukqFqZI4Wrujud6sjbn/view?usp=sharing

$\tiny{4.288.T20}$
Suppose that A is a square matrix of size n and $\alpha \in \CC$ is $\alpha$ scalar.
Prove that $\det{\alpha A} = \alpha^n\det{A}$.
Using $\alpha=5$
$\det{5A}=\det\left(5\left[
\begin{array}{rrr}
1&2\\3&4
\end{array} \right]\right)
=\det\left[
\begin{array}{rrr}
5&10\\15&20
\end{array} \right]=-50
$
$5^2\det{A}=5^2\det\left[
\begin{array}{rrr}
1&2\\3&4
\end{array} \right]
=\left[\begin{array}{cc} 25 & 50 \\ 75 & 100 \end{array} \right]=(25)(-50)$

Solution: $aA$ can be obtained from A by elementary row operations %of type II.
$\alpha A = E_1 \cdots E_n A$
where E, is the corresponding elementary matrix that multiplies the i-th row by the constant a.
It follows that
$\det{\alpha A}= \det{E_i}\cdots \det{E_n} \det(A)=\alpha^n\det{A} $ok I obviouly tried to follow the example above (link) but not quite sure I got the message on it...:unsure:
 
Physics news on Phys.org
The problem is asking you to prove this for any positive integer, n. You cannot just show it for n= 5. I would probably use "induction on n". When n= 1 this "n by n matrix" is just a number, a. Then $det(\alpha A)= \alpha a= \alpha^1 det(A)$.

Now suppose that for A any "k by k" matrix, it is true that $det(\alpha A)= \alpha^k det(A)$ and consider B, an arbitrary k+1 by k+ 1 matrix. Calculate $det(\alpha A)$ by "expansion on the first row. You get a sum of k+ 1 terms, each a product of a number, which will be multiplied by $\alpha$, times the determinant of a k by k matrix.
 
Last edited:
thanks that helped a lot...

I always have a :unsure::unsure:with proofs
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
Back
Top