MathLabs

Problem 3

Let P=A1A2⋯AkP=A_1A_2\cdots A_k be a convex polygon in the plane. The vertices A1,A2,…,AkA_1,A_2,\dots,A_k have integer coordinates and lie on a circle. Let SS be the area of PP. An odd positive integer nn is given such that the square of the length of each side of PP is an integer divisible by nn. Prove that 2S2S is an integer divisible by nn.
Step 4 of 5: A pp-adic valuation comparison forbids the relation
In plain words

If every summand carries a strictly higher power of pp than the total, a scaling argument using linear independence of distinct square roots of rationals over Q\mathbb{Q} derives a contradiction.

vp(qi2)>vp(q2) for every i ⇒ contradictionv_p(q_i^2)>v_p(q^2) \ \text{for every } i \ \Rightarrow\ \text{contradiction}
Detailed analysis

Assume now that every diagonal has squared length with pp-adic valuation <e<e. Let νp\nu_p be the valuation on nonzero rationals, and put ui=νp(OAi2)u_i=\nu_p(OA_i^2), ti=νp(AiAi+12)t_i=\nu_p(A_iA_{i+1}^2), and d=νp(A1Ak2)d=\nu_p(A_1A_k^2). The two segments OA1,OAkOA_1,OA_k are sides, so u1,uk≥eu_1,u_k\ge e; the other OAiOA_i are diagonals, so ui<eu_i<e for 2≤i≤k−12\le i\le k-1. Also ti≥et_i\ge e because AiAi+1A_iA_{i+1} is a side, whereas d<ed<e because A1AkA_1A_k is a diagonal. From qi=AiAi+12OAi2⋅OAi+12q_i=\dfrac{A_iA_{i+1}^2}{OA_i^2\cdot OA_{i+1}^2} and q=A1Ak2OA12⋅OAk2q=\dfrac{A_1A_k^2}{OA_1^2\cdot OA_k^2} we obtain νp(qi)=ti−ui−ui+1\nu_p(q_i)=t_i-u_i-u_{i+1} and νp(q)=d−u1−uk\nu_p(q)=d-u_1-u_k. Hence, at the two ends, νp(q1)−νp(q)=(t1−d)+(uk−u2)>0\nu_p(q_1)-\nu_p(q)=(t_1-d)+(u_k-u_2)>0 and νp(qk−1)−νp(q)=(tk−1−d)+(u1−uk−1)>0\nu_p(q_{k-1})-\nu_p(q)=(t_{k-1}-d)+(u_1-u_{k-1})>0: each parenthesis is at least 11. For 2≤i≤k−22\le i\le k-2, νp(qi)−νp(q)=(ti−d)+(u1+uk−ui−ui+1)>0\nu_p(q_i)-\nu_p(q)=(t_i-d)+(u_1+u_k-u_i-u_{i+1})>0, since the first parenthesis is at least 11 and the second is at least 22. Thus νp(qi)>νp(q)\nu_p(q_i)>\nu_p(q) for every ii, equivalently νp(qi2)>νp(q2)\nu_p(q_i^2)>\nu_p(q^2). We now use the square-root lemma: if positive rationals satisfy ∑ixi=x\sum_i\sqrt{x_i}=\sqrt{x}, then there is a positive rational bb such that all xi/b\sqrt{x_i/b} and x/b\sqrt{x/b} are rational. To see why, write each radicand as a rational square times a squarefree positive integer; the square roots of distinct squarefree integers are linearly independent over Q\mathbb Q, and positivity prevents cancellation between different square classes. Applying the lemma to the Ptolemy relation gives positive rationals ri=qi/br_i=\sqrt{q_i/b} and r=q/br=\sqrt{q/b} with ∑iri=r\sum_i r_i=r. Since νp(ri2)=νp(qi)−νp(b)\nu_p(r_i^2)=\nu_p(q_i)-\nu_p(b) and νp(r2)=νp(q)−νp(b)\nu_p(r^2)=\nu_p(q)-\nu_p(b), the strict inequality above yields νp(ri)>νp(r)\nu_p(r_i)>\nu_p(r) for every ii. The ultrametric inequality gives νp(∑iri)≥min⁡iνp(ri)>νp(r)\nu_p(\sum_i r_i)\ge\min_i\nu_p(r_i)>\nu_p(r), contradicting ∑iri=r\sum_i r_i=r. Therefore the assumption that all diagonals fail is impossible.