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.
Associates in : integers each of which divides the other
Definition
Integers and are associates, written , when each divides the other (Divisibility in : when for some integer ):
As a binary relation in the sense of Equivalence relation, equivalence class, and the quotient set this is the subset
of , and abbreviates .
Nothing is claimed here beyond the definition. That is an equivalence relation — reflexive, symmetric and transitive — is a statement about that has to be proved, and it is proved next, in For integers and the following are equivalent: and ; for a unit ; . Being associates is an equivalence relation whose class of is , together with the identification of the class of as . Until then the symbol is notation for membership of and carries no further content; in particular the language of equivalence classes is not used above.
Remarks
-
Why the notion is worth naming. Divisibility does not distinguish an integer from its negative (Divisibility is reflexive and transitive on , and is linear: if and then for all integers ; also implies , and ), so it is a preorder rather than an order: and while . Associates are exactly the pairs that divisibility cannot tell apart, and naming them is what lets the greatest common divisor be pinned down by a sign convention rather than left ambiguous up to that failure.
-
The classes have at most two elements, which is special to and comes from its group of units being ( is a commutative monoid whose group of units is ; equivalently holds exactly for and ). The class of is alone.
Depends on
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 42 results over 13 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Divisibility (ring theory) (Wikipedia) (standard reference, not scraped)