Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17
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.

A unit square modulo an odd integer has Jacobi symbol one

Statement

If a is a unit square modulo an odd positive integer n, then (an)=1.

Explicitly, if gcd(a,n)=1 and x2a(modn) for some integer x, then the Jacobi symbol of a modulo n is 1.

Facts & Assumptions

Given: An odd positive integer n and integers a,x such that gcd(a,n)=1 and x2a(modn).

[L1]

The assignment χn([u]n)=(un) is a group homomorphism (Z/n)×{±1} (For fixed odd modulus, the Jacobi symbol is a homomorphism on the unit group).

[L2]

A residue class [u]n is a unit if and only if gcd(u,n)=1 (For n1, [a]n is a unit if and only if gcd(a,n)=1).

Proof

technique · direct
1.1

By [L2], [a]n is a unit. If v is its inverse, then [x]n([x]nv)=[x]n2v=[a]nv=[1]n, so [x]n is also a unit and lies in the domain of [L1].

L1L2givenalgebra
2.1

Applying [L1] to [a]n=[x]n2 gives (an)=χn([a]n)=χn([x]n)2=1, since χn([x]n){±1}.

step 1.1L1algebra

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 47 results over 16 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources