Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedprecheck passaudited 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.

A=B={0,1,2} in Z/7: the sumset has five elements and the bound is tight

Example

Let A=B={0,1,2}⊆Z/7.

Facts & Assumptions

Given: the set A=B={0,1,2} in Z/7.

[L1]

Cauchy-Davenport gives ∣A+B∣≥min⁡{7,∣A∣+∣B∣−1} (Cauchy–Davenport: for p prime and nonempty A,B⊆Z/p, ∣A+B∣≥min⁡{p,∣A∣+∣B∣−1}).

Verification

technique · direct
1.1given

The sumset is A+B={0,1,2,3,4}, since the nine sums reduce to 0,1,2,1,2,3,2,3,4 modulo 7.

2.1L1step 1.1

Therefore ∣A+B∣=5=3+3−1, so the lower bound of [L1] is attained.

3.1L1∎

The other branch of the theorem is also visible: if A={0,1,2,3} and B={0,1,2,3,4}, then A+B=Z/7.

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