Two compact parity formulas complete the practical reciprocity algorithm. I will separate the object being defined from the consequence being claimed.
The data
For an odd prime \(p\), the Legendre symbol \(\left(\frac ap\right)\) records whether \(a\) is a nonzero square modulo \(p\). Reciprocity exchanges numerator and denominator up to a sign.
There are two layers here: the object \(\mathsf D\) and the law \(\mathsf C\). Writing them separately makes the direction of \(\Longrightarrow\) visible and keeps an accidental converse from slipping in.
Derivation
The middle display is intentionally dense: it is where signs, bounds, multiplicities, or normalising factors are most likely to be lost.
Invariant content
The two-row display is also a debugging tool: if the conclusion changes when only notation changes, some hidden choice has entered the argument.
Scope
The symbol is defined modulo an odd prime and is not ordinary division. Composite odd denominators require the Jacobi symbol, which can equal one without certifying a square.
The notation is dense, but it is doing honest work: every delimiter records scope and every index records dependence. Removing one should require a mathematical reason.