ISI MStat PSB 2011 Problem 1 | Linear Algebra

This is a quite pleasant sample problem from ISI MStat PSB 2011 Problem 1. It is mainly about, patterns in matrices and determinants and using a special kind of determinant decomposition, which is widely used in Statistics . Give it a try !

Problem- ISI MStat PSB 2011 Problem 1


Let A be a nxn matrix, given as

\(A_{nxn}\) = \begin{pmatrix} a & b & \cdots & b \\b& a & \cdots & b \\ \vdots & \vdots & \ddots & \vdots \\ b & b & \cdots & a \end{pmatrix} ;

where \( a \neq b \) and \( a+(n-1)b= 0 \).

Suppose B=A+ \(\frac{\vec{1} \vec{1'}}{n} \) where \( \vec{1} =(1,1,.....,1)' \) is nx1 vector.

Show that,

(a) B is non-singular .

(b) \(A{B}^{-1} A =A\)

Prerequisites


Basic Matrix multiplication

Determinants.

Matrix decomposition .

Solution :

While attacking a problem related to matrices, the primary approach which I find very helpful is, realizing if there is any subtle pattern hidden. Similarly, here also a pattern is very much prominent exhibited in the matrix A, hence we will break A as,

\(A=(a-b) I_{n} +b \vec{1} \vec{1'} \).

which reduces, \( B = (a-b) I_{n} + (b + \frac{1}{n}) \vec{1}\vec{1'} \).

now, we can find Determinant of B, by using a known decomposition , which follows from determinants of partitioned matrices.

we have the decomposition as for some non-singular M and column vectors \(\vec{u}\) \(\vec{v}\) ,

we have \( |M+\vec{u}\vec{v'}|=|M|(1+ \vec{v'} M^{-1}\vec{u}) \), when \( \vec{v'}M^{-1}\vec{u} \neq -1\).

for, this particular problem , \( \vec{v}\)=\(\vec{u}\)= \( \sqrt{(b+ \frac{1}{n})}\vec{1} \) , \(M= (a-b)I_n \) , which is non-singular, and clearly \( nb \neq 0\),

If you are not familiar with these, then become friendly with this decomposition, as it is has very important and frequent applications in Statistics. Best to derive it !

So, \( |B|= |(a-b)I_{n}+ (b + \frac{1}{n}) \vec{1}\vec{1'}|\)= \( (a-b)^{n} ( 1+\vec{1'} \frac{I_n}{(a-b)}\vec{1}) \) =\( (a-b)^{n-1}( a+(n-1)b+1 ) \) =\( (a-b)^{n-1} \neq 0\)

as \( a+(n-1)b=0 \) and \( a \neq b \), So, hence B is non-singular. Also, B is invertible, we will need this to do the next part

for the second part (b), observe that \(A\vec{1}=\vec{0}\) why ??? , so, \( B\vec{1}=\vec{1} \Rightarrow \vec{1}= B^{-1}\vec{1} \) ................(*)

So, \( B=A+ \frac{\vec{1} \vec{1'}}{n} \Rightarrow I_n= B^{-1}A+ \frac{1}{n} B^{-1}\vec{1}\vec{1'}=B^{-1}A+ \frac{1}{n}\vec{1}\vec{1'} \) ....using(*)

now left multiplying A, to the above matrix equation, we have

\(A=AB^{-1}A+\frac{1}{n}A\vec{1}\vec{1'}=AB^{-1}A \). hence , we are done !!


Food For Thought

Suppose, it is given that \(Trace(A)=Trace(A^2)=n \) , Can You show that all the eigenvalues of A are equal to 1 ? Is it true for any symmetric matrix,following the given condition? Give it a thought !

[ In case, you don't know what eigenvalues are, its a scalar, \(\lambda\) which one may find for a square matrix C, such that, for a non-null \(\vec{x}\),

\( C\vec{x}= \lambda\vec{x}\), for a matrix order n, one will find n such scalars or eigenvalues, say \( \lambda_1,.....,\lambda_1\) ,

then \( \lambda_1+ .....+ \lambda_n= Trace(C) \), and , for symmetric matrices, all eigenvalues are real, so you don't need to worry much but you can obviously verify it !! ]


Similar Problems and Solutions



ISI MStat PSB 2008 Problem 10
Outstanding Statistics Program with Applications

Outstanding Statistics Program with Applications

Subscribe to Cheenta at Youtube


Real Symmetric matrix: TIFR 2018 Part A, Problem 6

[et_pb_section fb_built="1" _builder_version="3.22.4"][et_pb_row _builder_version="3.25"][et_pb_column type="4_4" _builder_version="3.25" custom_padding="|||" custom_padding__hover="|||"][et_pb_text _builder_version="3.22.4" text_font="Raleway|300|||||||" text_text_color="#ffffff" header_font="Raleway|300|||||||" header_text_color="#e2e2e2" background_color="#0c71c3" border_radii="on|5px|5px|5px|5px" box_shadow_style="preset3" custom_padding="20px|20px|20px|20px"]

Understand the problem

[/et_pb_text][et_pb_text _builder_version="3.26.6" text_font="Raleway||||||||" background_color="#f4f4f4" box_shadow_style="preset2" custom_margin="10px||10px" custom_padding="10px|20px|10px|20px"]True or false: Let $latex A$ be a $latex 3 \times 3$ real symmetric matix s.t $latex A^6=I$. Then $latex A^2=I$[/et_pb_text][/et_pb_column][/et_pb_row][et_pb_row _builder_version="3.25"][et_pb_column type="4_4" _builder_version="3.25" custom_padding="|||" custom_padding__hover="|||"][et_pb_accordion open_toggle_text_color="#0c71c3" _builder_version="3.26.8" toggle_font="||||||||" body_font="Raleway||||||||" text_orientation="center" custom_margin="10px||10px"][et_pb_accordion_item title="Source of the problem" open="on" _builder_version="3.26.8"]TIFR 2018 Part A, Problem 6[/et_pb_accordion_item][et_pb_accordion_item title="Topic" _builder_version="3.26.8" open="off"]Linear Algebra[/et_pb_accordion_item][et_pb_accordion_item title="Difficulty Level" _builder_version="3.26.8" open="off"]Medium[/et_pb_accordion_item][et_pb_accordion_item title="Suggested Book" _builder_version="3.26.8" open="off"]Linear Algebra, Hoffman and Kunze[/et_pb_accordion_item][/et_pb_accordion][et_pb_text _builder_version="3.23.3" text_font="Raleway|300|||||||" text_text_color="#ffffff" header_font="Raleway|300|||||||" header_text_color="#e2e2e2" background_color="#0c71c3" border_radii="on|5px|5px|5px|5px" box_shadow_style="preset3" custom_margin="48px||48px" custom_padding="20px|20px|20px|20px"]

Start with hints

[/et_pb_text][et_pb_tabs active_tab_background_color="#0c71c3" inactive_tab_background_color="#000000" _builder_version="3.26.8" tab_text_color="#ffffff" tab_font="||||||||" background_color="#ffffff"][et_pb_tab title="Hint 0" _builder_version="3.22.4"]Do you really need a hint? Try it first!

[/et_pb_tab][et_pb_tab title="Hint 1" _builder_version="3.26.8"]First investigate the properties of Real Symmetric Matrices.
The most important property of a real symmetric matrix A is encoded in “Spectral Decomposition” of A.
[/et_pb_tab][et_pb_tab title="Hint 2" _builder_version="3.26.8"]
If matrix $latex A$ then there exists $latex Q$ with $latex Q'Q=I$ such that $latex A = Q'BQ$,where $latex B$ is a diagonal matrix with diagonal entries being the eigenvalues of A which are real numbers.
Here assume that the eigen values are $latex a,b,c$.
We will use this spectral decomposition of A.
[/et_pb_tab][et_pb_tab title="Hint 3" _builder_version="3.26.8"]
Observe that $latex A^6 = I \Rightarrow Q'(B^6)Q = I$.(Check!)
$latex Q'(B^6)Q=I \Rightarrow Q[Q'(B^6)Q]Q'= QQ'= I \Rightarrow B^6=I$ . [as Q is orthogonal]
$latex B^6$ is a diagonal matrix with diagonal entries real numbers raised to the power 6 i.e $latex a^6,b^6$ and $latex c^6$.
[/et_pb_tab][et_pb_tab title="Hint 4" _builder_version="3.26.8"]
Now hint 3 implies $latex a^6=1,b^6=1$ and $latex c^6=1$.
$latex a^2=1,b^2=1$ and $latex c^2=1$ as $latex a,b$ and $latex c$ are real numbers. This means $latex B^2=I$.
$latex A^2 = Q'(B^2)Q = Q'Q = I$.
Hence the given statement is TRUE.
[/et_pb_tab][/et_pb_tabs][et_pb_text _builder_version="3.23.3" text_font="Raleway|300|||||||" text_text_color="#ffffff" header_font="Raleway|300|||||||" header_text_color="#e2e2e2" background_color="#0c71c3" border_radii="on|5px|5px|5px|5px" box_shadow_style="preset3" custom_margin="48px||48px" custom_padding="20px|20px|20px|20px"]

Watch the video

[/et_pb_text][et_pb_code _builder_version="3.26.4"]
[/et_pb_code][et_pb_text _builder_version="3.23.3" text_font="Raleway|300|||||||" text_text_color="#ffffff" header_font="Raleway|300|||||||" header_text_color="#e2e2e2" background_color="#0c71c3" border_radii="on|5px|5px|5px|5px" box_shadow_style="preset3" min_height="12px" custom_margin="50px||50px" custom_padding="20px|20px|20px|20px"]

Connected Program at Cheenta

[/et_pb_text][et_pb_blurb title="College Mathematics Program" url="https://cheenta.com/collegeprogram/" image="https://cheenta.com/wp-content/uploads/2018/03/College-1.png" _builder_version="3.23.3" header_font="||||||||" header_text_color="#e02b20" header_font_size="48px" border_color_all="#e02b20" link_option_url="https://cheenta.com/collegeprogram/"]

The higher mathematics program caters to advanced college and university students. It is useful for I.S.I. M.Math Entrance, GRE Math Subject Test, TIFR Ph.D. Entrance, I.I.T. JAM. The program is problem driven. We work with candidates who have a deep love for mathematics. This program is also useful for adults continuing who wish to rediscover the world of mathematics.[/et_pb_blurb][et_pb_button button_url="https://cheenta.com/collegeprogram/" button_text="Learn More" button_alignment="center" _builder_version="3.23.3" custom_button="on" button_bg_color="#0c71c3" button_border_color="#0c71c3" button_border_radius="0px" button_font="Raleway||||||||" button_icon="%%3%%" button_text_shadow_style="preset1" box_shadow_style="preset1" box_shadow_color="#0c71c3" background_layout="dark"][/et_pb_button][et_pb_text _builder_version="3.22.4" text_font="Raleway|300|||||||" text_text_color="#ffffff" header_font="Raleway|300|||||||" header_text_color="#e2e2e2" background_color="#0c71c3" border_radii="on|5px|5px|5px|5px" box_shadow_style="preset3" custom_margin="50px||50px" custom_padding="20px|20px|20px|20px"]

Similar Problems

[/et_pb_text][et_pb_post_slider include_categories="12" _builder_version="3.23.3"][/et_pb_post_slider][et_pb_divider _builder_version="3.22.4" background_color="#0c71c3"][/et_pb_divider][/et_pb_column][/et_pb_row][/et_pb_section]