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.
Every with has a unique th root with constant coefficient in a commutative -algebra
Statement
Let be a commutative -algebra, , and . There is a unique such that
namely . When , this unique root is .
Facts & Assumptions
Given: The hypotheses and notation of the statement above.
In a commutative -algebra, formal and are inverse group homomorphisms on and , and for and the exponent-addition and exponent-multiplication laws hold (Formal and are inverse homomorphisms and formal binomial powers obey the expected addition laws).
Proof
The power law gives , so the stated series is a root with constant coefficient .
If and , the logarithm addition law gives . Since is invertible in a -algebra, ; applying gives . This proves uniqueness.
For , the construction is , and step 1.2 excludes any other constant-one root.
Depends on
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 25 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
- Benjamin Sambale, An Invitation to Formal Power Series (standard reference, not scraped)