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.
Rational formal power series, proper presentations and reduced denominators
Definition
Let be a commutative ring. A formal power series (Formal power series over a commutative ring and the coefficient-extraction functional ) is rational if there are polynomials such that is a unit and
in . Equivalently, , where is the unique formal inverse supplied by A formal power series is a unit exactly when its constant coefficient is a unit.
Now let be a field. Multiplying numerator and denominator by gives a normalised presentation with . Such a presentation is proper when or (Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree). It is reduced when and have no common nonunit factor. A polynomial series has the reduced presentation , and the zero series has reduced presentation .
A polynomial occurring in a normalised reduced presentation is called a reduced denominator of . The minimal-order theorem will show that all reduced denominators of one series have the same degree.
Depends on
Used by
- The initial-value, recurrence-sequence, numerator and fixed-denominator rational-series spaces all have dimension d Lemma
- Rational formal power series are closed under sums and Cauchy products Proposition
- Reciprocal-root convention: χ(t)=∏ᵢ(t-λᵢ)^mᵢ corresponds to Q(x)=∏ᵢ(1-λᵢ x)^mᵢ Remark
- Words over a finite alphabet avoiding finitely many nonempty factors have a rational length generating function Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 25 results over 12 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
- R. P. Stanley, Enumerative Combinatorics, vol. 1, 2nd ed., Section 4.1 (standard reference, not scraped)
- B. E. Sagan, Combinatorics: The Art of Counting, Sections 3.6-3.7 (standard reference, not scraped)