Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck 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.

The reduced primitive forms of discriminant −4

Example

The only reduced primitive positive-definite binary quadratic form of discriminant −4 is

x2+y2=(1,0,1).

Consequently h(−4)=1.

Facts & Assumptions

Given: A reduced primitive positive-definite form (a,b,c) of discriminant −4.

[L1]

A reduced form of discriminant Δ satisfies a≤∣Δ∣/3 (A reduced positive-definite form of discriminant Δ satisfies a≤∣Δ∣/3).

[L3]

The class number h(Δ) counts proper-equivalence classes of primitive positive-definite forms of discriminant Δ (The class number of primitive positive-definite binary quadratic forms of discriminant Δ).

Verification

technique · direct
1.1L1givenalgebra

Here a≤4/3<2 by [L1], so the positive integer a must be 1.

2.1step 1.1algebra

The discriminant equation gives −4=b2−4c, so 4c=b2+4. Since the form is reduced, ∣b∣≤1; the choices b=±1 make c=5/4, not an integer, while b=0 gives c=1. Thus the only reduced possibility is (1,0,1).

3.1L2L3step 2.1∎

The form (1,0,1) is primitive, so by [L2] there is exactly one proper-equivalence class of primitive positive-definite forms of discriminant −4. Hence [L3] gives h(−4)=1.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

12 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