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.
Nonzero constant series can multiply to zero in
Example
In , the nonzero constant series satisfies
Thus exact additivity of formal order cannot be extended from domains to all commutative rings.
Facts & Assumptions
Given: The hypotheses and notation of the statement above.
Two residue classes are equal exactly when their representatives are congruent (The congruence class and the quotient set ).
Multiplication modulo is defined by (Addition and multiplication on by and ).
The product on is the Cauchy product (Cauchy multiplication makes a commutative ring containing as the finitely supported subring).
Over an integral domain, formal order is additive on products with the convention, and the power-series ring is an integral domain (Formal order is non-Archimedean under sums and additive under products over a domain).
Verification
The residue class of modulo is nonzero because , while its square is . The constant-series embedding preserves multiplication, so the two nonzero constant series multiply to the zero series.
Each factor has formal order , whereas the product has order . This does not contradict the exact product law because is not an integral domain.
Depends on
- The congruence class $[a]_n$ and the quotient set $\mathbb{Z}/n$
- Addition and multiplication on $\mathbb{Z}/n$ by $[a]_n+[b]_n=[a+b]_n$ and $[a]_n[b]_n=[ab]_n$
- For every natural $n$, $(\mathbb{Z}/n,+)$ is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold
- Formal order is non-Archimedean under sums and additive under products over a domain
- Cauchy multiplication makes $R\llbracket x\rrbracket$ a commutative ring containing $R[x]$ as the finitely supported subring
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 59 results over 20 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.