Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Quadratic reciprocity via Frobenius

Statement

For distinct odd primes p and q, (pq)(qp)=(−1)(p−1)(q−1)/4.

Facts & Assumptions

Given: Distinct odd primes p and q, and p∗=(−1)(p−1)/2p.

[F1]

Quadratic Frobenius restriction identity: for distinct odd primes p,q, (p∗q)=(qp) (Quadratic reciprocity as a Frobenius restriction identity).

[F2]

Legendre symbol multiplicativity: (ab/q)=(a/q)(b/q) for all integers a,b; consequently (((−1)kp)/q)=((−1)/q)k(p/q) for every integer k≥0, and (a/q)∈{−1,0,1} with (a/q)=0 exactly when q∣a (The Legendre symbol is multiplicative for all integer numerators, The Legendre symbol, including its zero value).

[F3]

First supplement: (−1/q)=(−1)(q−1)/2 (First supplement: (−1/p)=(−1)(p−1)/2).

[F4]

q∤p, so (p/q)≠0 and hence (p/q)2=1 (The Legendre symbol, including its zero value).

Proof

technique · direct
1.1F2

By [F2], p∗=(−1)(p−1)/2p gives (p∗q)=(−1q)(p−1)/2(pq).

1.2F3algebra

By [F3], (−1q)(p−1)/2=(−1)((p−1)/2)((q−1)/2)=(−1)(p−1)(q−1)/4, the exponent (p−1)(q−1)/4 being an integer because p−1 and q−1 are even.

1.3F4

Since p≠q, the symbol (p/q) is ±1, so (p/q)2=1.

2.1step 1.1step 1.2

Substituting step 1.2 into step 1.1 gives (p∗q)=(−1)(p−1)(q−1)/4(pq).

3.1F1step 2.1

Combining with [F1], (qp)=(p∗q)=(−1)(p−1)(q−1)/4(pq).

4.1step 1.3step 3.1∎

Multiplying both sides of step 3.1 by (pq) and using (p/q)2=1 from step 1.3 yields (pq)(qp)=(−1)(p−1)(q−1)/4(pq)2=(−1)(p−1)(q−1)/4.

Remarks

  • The earlier reciprocity theorem is not used. The only inputs are the Frobenius restriction identity, Legendre multiplicativity and the first supplement; in particular neither the published quadratic reciprocity theorem nor an analytic Gauss-sum sign is a supplier.
  • Symmetry check. (p−1)(q−1)/4 is symmetric in p and q, as the product form must be; the two special values p=q and the case p=2 are excluded, the latter being exactly the case covered by the second supplement Second supplement from Frobenius on Q(zeta_8).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources