Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (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.

A non-reduced positive-definite form admits an equivalent positive-definite form with smaller reduction measure

Statement

Let f=(a,b,c) be a positive-definite integral binary quadratic form that is not reduced. Define its reduction measure

μ(f):=3a+c+ε(f),

where ε(f)=0 when b≥0 whenever ∣b∣=a or a=c, and ε(f)=1 otherwise. Then there exists a properly equivalent positive-definite form g with

μ(g)<μ(f).

Facts & Assumptions

Given: A positive-definite integral binary quadratic form f=(a,b,c) that is not reduced.

[F1]

Proper equivalence is substitution by a determinant-one integer matrix (Proper equivalence of binary quadratic forms).

[F2]

Proper equivalence preserves the discriminant, and hence preserves primitivity as well (Proper equivalence preserves discriminant and primitivity of the form).

[F3]

A form is positive definite exactly when its leading coefficient is positive and its discriminant is negative (An integral binary quadratic form is positive definite exactly when its leading coefficient is positive and its discriminant is negative).

[F4]

A positive-definite form is reduced exactly when ∣b∣≤a≤c and b≥0 whenever ∣b∣=a or a=c (Reduced positive-definite binary quadratic forms).

Proof

technique · direct
1.1F3

Since f is positive definite, [F3] gives a>0 and Δ:=b2−4ac<0.

2.1F1F2F3F4step 1.1constructalgebra

If c<a or if c=a and b<0, let g=f∣(0−110)=(c,−b,a). This matrix lies in SL2(Z), so g is properly equivalent to f; by [F2] and [F3] it is again positive definite because its leading coefficient is c>0 and its discriminant is still Δ<0. Its measure satisfies μ(g)=3c+a+ε(g)<3a+c+ε(f)=μ(f) because c<a gives a drop of at least 1, and when c=a with b<0 the boundary defect disappears so ε(g)=0<1=ε(f).

3.1F1F4step 1.1choose

Assume now that step 2.1 does not apply. Then a≤c and, because f is not reduced, one must have b∉(−a,a]. Choose the unique integer k for which b′:=b+2ak lies in (−a,a], and let g=f∣(1k01)=(a,b′,c′), where c′=ak2+bk+c.

4.1F2F3step 1.1step 3.1algebra

The new form g is properly equivalent to f, so it has the same discriminant Δ<0 by [F2]; its leading coefficient is still a>0, so [F3] makes it positive definite. Also 4a(c′−c)=b′2−b2, hence c′≤c, with strict inequality when ∣b′∣<∣b∣.

5.1step 2.1step 3.1step 4.1algebra

If ∣b∣>a, then ∣b′∣<∣b∣, so step 4.1 gives c′<c. In this case ε(f)=0: if a<c there is no boundary defect, while if a=c then step 2.1 was excluded and therefore b>0.

5.2F4step 3.1step 4.1algebra

If ∣b∣=a, then step 2.1 is excluded, so a<c and the only way b∉(−a,a] can occur is b=−a. Then the chosen residue is b′=a, so c′=c and the boundary defect disappears: ε(g)=0<1=ε(f). Hence again μ(g)<μ(f).

6.1F4step 5.1algebra

If ∣b∣>a and c′>a, then −a<b′≤a<c′, so g already satisfies the reduced-form boundary sign conditions and ε(g)=0. Therefore μ(g)=3a+c′<3a+c=μ(f).

6.2F1F4step 2.1step 4.1step 5.1algebra

If ∣b∣>a and c′=a, then step 5.1 gives c>a because otherwise c=a and c′=c would force ∣b′∣=∣b∣, contradicting ∣b′∣<∣b∣. If b′≥0, then ε(g)=0 and μ(g)=4a<3a+c=μ(f). If instead b′<0, let h=g∣(0−110)=(a,−b′,a). Then h is properly equivalent to f, still positive definite, and ε(h)=0, so again μ(h)=4a<3a+c=μ(f).

6.3F1step 4.1step 5.1algebra

If ∣b∣>a and c′<a, let h=g∣(0−110)=(c′,−b′,a). Then h is properly equivalent to f and positive definite. Since c′≤a−1 and ε(h)≤1, μ(h)=3c′+a+ε(h)≤3(a−1)+a+1=4a−2<4a≤3a+c=μ(f).

7.1F4step 2.1step 6.1step 6.2step 6.3step 5.2∎

Step 2.1 covers the case c<a or c=a with b<0; steps 6.1, 6.2, and 6.3 cover the remaining case ∣b∣>a; and step 5.2 covers the case ∣b∣=a with b<0. Therefore every non-reduced positive-definite form is properly equivalent to a positive-definite form of smaller reduction measure.

Depends on

Used by

Dependency tree · two levels

9 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