Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26
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.

7 and 28 have four-square representations with no zero coordinate

Example

The integers 7 and 28 have the four-square representations

7=22+12+12+12,28=52+12+12+12,

and in each of them every coordinate is nonzero. That is not an accident of these two displays: no representation of either integer can have a vanishing coordinate, because deleting a zero coordinate would exhibit the integer as a sum of three squares, which Positive integers 4am with m7(mod8) are not sums of three integer squares forbids for 7=407 and for 28=417. The two are the cases a=0 and a=1 of Positive integers 4am with m7(mod8) need four nonzero squares at m=7.

Facts & Assumptions

Given: The integers 7 and 28.

[F1]

A representation of a nonnegative integer n as a sum of four squares is an ordered quadruple (a,b,c,d)Z4 with n=a2+b2+c2+d2 (Representations as sums of four squares).

[F2]

For a,b,nZ, ab(modn) means n(ab) (Congruence modulo an integer: ab(modn) when n(ab), including the moduli 0 and 1).

[L1]

For aN and a positive integer m with m7(mod8), in every representation (x1,x2,x3,x4)Z4 of 4am as a sum of four integer squares all four coordinates are nonzero (Positive integers 4am with m7(mod8) need four nonzero squares).

[L2]

Every nonnegative integer is a sum of four integer squares (Lagrange's four-square theorem: every nonnegative integer is a sum of four integer squares).

[L3]

For aN and a positive integer m with m7(mod8), there are no integers x,y,z with 4am=x2+y2+z2 (Positive integers 4am with m7(mod8) are not sums of three integer squares).

Verification

technique · direct
1.1

Both displays are representations in the sense of [F1], whose existence [L2] guarantees in advance: 4+1+1+1=7 and 25+1+1+1=28; and in each the four coordinates 2,1,1,1 and 5,1,1,1 are all nonzero.

givenF1L2algebra
1.2

The integer 7 is positive and 877, so 77(mod8) by [F2]; moreover 407=7 and 417=28, so both integers have the form required by [L1] and [L3] with m=7 and a=0 or a=1.

givenF2algebra
2.1

If a representation of 7 or of 28 had a vanishing coordinate, deleting it would leave three integers whose squares sum to 7 or to 28 respectively, and by step 1.2 this is what [L3] excludes; so no representation of either integer has a vanishing coordinate.

step 1.1step 1.2L3algebra
3.1

Hence 7 and 28 each have a four-square representation, displayed in step 1.1, and every such representation has all four coordinates nonzero, which is [L1] at a=0 and at a=1.

step 1.1step 1.2step 2.1L1F1

Remarks

Why both a=0 and a=1 are shown. The obstruction is stated for 4am, and its induction has a base case and a step. The witness 7 exercises the base case and 28 the first instance of the step, where the coordinates of a putative three-square representation are halved.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

22 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