Maths Olympiad Prep

Track / Stage 6 / 226 of 400 #1706 of 2444

Problem 1706

National Olympiad, first round
Algebra Difficulty 6.4 Prove it Brazilian Math Olympiad · Brazil

Let nn be an integer and n1n_1 be one of its divisors. Let AA be a n×nn \times n symmetric matrix defined by ai,i=4a_{i,i} = 4, ai,i+1=ai+1,i=1a_{i,i+1} = a_{i+1,i} = -1 for all ii such that 1in11 \le i \le n-1 and i+1i+1 is not a multiple of n1n_1, ai,i+n1=ai+n1,i=1a_{i,i+n_1} = a_{i+n_1,i} = -1 and ai,j=0a_{i,j} = 0 otherwise.
Prove that AA has an inverse and that all of the entries in the inverse are positive.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

Let's find the inverse of A/4=IXA/4 = I - X, where all entries in XX are either 00 or 1/41/4. We will use the series
(IX)1=I+X+X2+X3+ (I - X)^{-1} = I + X + X^2 + X^3 + \dots
First let's prove that this series converges. It suffices to show that the maximum MM such that XwMw\|Xw\| \le M\|w\| for all column vectors ww of XX is less than 11, so the sum of the entries always decrease by a factor smaller than 11 if you multiply a vector by X2X^2; then we sum the series as (I+X)(I+X2+X4+)(I+X)(I+X^2+X^4+\dots). Notice that every row of XX has at most four nonzero entries, all of which are equal to 1/41/4. So if w=(a1,a2,,an)w = (a_1, a_2, \dots, a_n) then every entry of XwXw is of the form ar1+ar2++ars4\frac{a_{r_1}+a_{r_2}+\dots+a_{r_s}}{4}, s4s \le 4. By the Cauchy-Schwarz inequality, its square is at most s16(ar12+ar22++ars2)ar12+ar22++ars24\frac{s}{16}(a_{r_1}^2+a_{r_2}^2+\dots+a_{r_s}^2) \le \frac{a_{r_1}^2+a_{r_2}^2+\dots+a_{r_s}^2}{4}, with equality if and only if ar1=ar2==arsa_{r_1} = a_{r_2} = \dots = a_{r_s} and s=4s=4. Summing over all the rows, the sum of squares of the coordinates of XwXw is at most a12+a22++an2=w2a_1^2 + a_2^2 + \dots + a_n^2 = \|w\|^2, because all columns of XX have at most four nonzero entries. But equality would only happen if all entries aia_i are equal and s=4s=4 always, which does not happen for, say, the first row. So M<1M < 1 and the series converges.

Consider the graph whose vertices are the numbers v1,v2,,vnv_1, v_2, \dots, v_n and we connect viv_i and vjv_j if and only if the entry xijx_{ij} in XX is 1/41/4. By the definition of the matrix AA, this graph has a lattice-like configuration: it can be split in several paths v1v2vn11v_1v_2 \dots v_{n_1-1}, vk1vk1+1v(k+1)n11v_{k_1}v_{k_1+1} \dots v_{(k+1)n_1-1}, 1kn211 \le k \le \frac{n}{2}-1, vrvr+n1vr+2n1vr+nn1v_r v_{r+n_1} v_{r+2n_1} \dots v_{r+n-n_1}, 1rn11 \le r \le n_1. It is clear that this graph is connected. Since the entry mijm_{ij} in XkX^k is nonzero if and only if there exists a circuit from ii to jj with kk edges, for all i,ji, j there is kk such that the corresponding entry mijm_{ij} in XkX^k is nonzero. This proves that all entries in the inverse of AA is positive.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.