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.
An indefinite proper-equivalence class can contain a cycle of reduced forms
Statement refuted
The uniqueness theorem for reduced positive-definite forms does not extend to positive discriminant. Under Granville's positive-discriminant convention, both
are reduced forms of discriminant , and they are properly equivalent.
Facts & Assumptions
Given: The forms and .
Positive-definite proper-equivalence classes contain exactly one reduced form (Each proper-equivalence class of positive-definite integral binary quadratic forms contains exactly one reduced form).
The discriminant of is (The discriminant of a binary quadratic form).
Counterexample
Both forms have discriminant , since and .
The matrix has determinant , and direct substitution gives . Thus and are properly equivalent.
Under Granville's positive-discriminant convention, a form of discriminant is reduced when . Since , one has and . Hence for and for , so both are reduced in that convention.
The two reduced forms and are distinct, yet step 1.2 puts them in one proper-equivalence class. So the uniqueness statement [L1], which is true for positive-definite forms, does not extend to positive discriminant.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
6 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
- Andrew Granville, Binary Quadratic Forms, Section 4.6 (standard reference, not scraped)