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.
Binary words avoiding any fixed nonempty factor have a rational length generating function
Statement
Fix a nonempty binary word . If is the number of words in that do not contain as a contiguous factor, then is a rational formal power series over .
Facts & Assumptions
Given: A nonempty word over the finite alphabet .
Words over a finite alphabet that avoid a finite set of nonempty factors have a rational length generating function (Words over a finite alphabet avoiding finitely many nonempty factors have a rational length generating function).
Proof
The alphabet is finite, and is a finite set of nonempty words.
Apply [L1] using step 1.1. Its conclusion is the asserted rationality.
Depends on
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: 19 results over 6 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., Proposition 4.7.8 (standard reference, not scraped)