The Hasse-Minkowski theorem says that a nondegenerate quadratic form over a number field has a nonzero isotropic vector over that field if and only if it has one over every completion. In particular, over one tests and every . For the present integral form, a rational isotropic vector can be multiplied by a common denominator to give an integer one. This is the Hasse-Minkowski principle.
Write , and . All three primes are odd and exceed three: or would make composite. The second supplementary law for quadratic reciprocity gives
Necessity at . Scale any nonzero vector over so that its coordinates lie in and at least one is a unit. Reduction of its equation modulo gives , since twelve is invertible modulo . If the Legendre symbol is , this forces . The original equation then forces , because its other two terms are divisible by . This contradicts the normalization. Thus
Sufficiency at the coefficient primes. Suppose . A nonzero solution modulo is . Its -derivative is nonzero modulo , so fixing the other two coordinates and applying the Hensel lemma lifts it to .
Since , the same Legendre symbol criterion gives . Modulo , the equation reduces to , and the vector is a simple zero in the coordinate. It lifts to . Modulo , the coefficients of and are respectively and , so is a zero with nonzero -derivative. It lifts to .
The remaining odd primes. If is odd and divides none of , the reduced ternary quadratic form is nondegenerate. An elementary finite-field argument finds a zero with : if its coefficients are , the sets
both have elements, so intersect. The resulting vector has nonzero -derivative , and the Hensel lemma lifts it. This isotropy of nondegenerate ternary quadratic forms over finite fields verifies every remaining odd completion without an extra congruence condition.
The dyadic and real places. Setting reduces the dyadic problem to
The right side is a 2-adic unit congruent to modulo eight. The unit square classes of the p-adic integers computed above show that it is a square in . This also explains the printed hint: its integer can be taken as . Over , the positive and negative coefficients make the form indefinite; for instance gives a nonzero zero.
All completions now have a nonzero isotropic vector. The Hasse-Minkowski theorem, followed by clearing denominators, proves
For an odd prime , the Legendre symbol is
Euler criterion states that
The Gauss lemma says that, for , if of the least positive residues of
lie in , then
To prove it, replace every residue above by its negative. The resulting absolute residues are distinct up to sign and therefore form a permutation of
Multiplying the congruences gives
Cancel the nonzero factorial and apply Euler's criterion.
For , the residues are . The number above is
whose parity gives the second supplementary law for quadratic reciprocity
Consequently, for odd primes,
The congruence is also soluble for .
Because and commute, the matrix binomial theorem gives
For prime , every intermediate coefficient is divisible by , proving the prime-power binomial congruence for a matrix
For
one has and . If , then
so . If , then and
so .
By Euler criterion, . In either case the preceding congruence gives . Since has the same parity as for , this is the second supplementary law for quadratic reciprocity