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.
Substituting a variable's productions into a leading variable occurrence preserves the language
Statement
Let be a context-free grammar containing the production Suppose the productions of in are exactly where are words over variables and terminals. Let be the grammar obtained by deleting the production and replacing it by the family while keeping every other production of .
Then
Facts & Assumptions
Given: Grammars and related by the displayed substitution step, with the displayed list equal to the full family of -productions in .
A finite derivation is a chain of one-step derivations, by One-step derivation and finite derivation in a context-free grammar.
The language consists of the terminal words derivable from the start symbol, by The language generated by a CFG.
Proof
Let be one use of the deleted production in a derivation of a terminal word, and follow the distinguished occurrence of created by this step. It is eventually rewritten by some , since the displayed rules are all the productions of . Every intervening step rewrites a different variable occurrence. Such a step commutes with the rewrite of the distinguished : applying the two context-free productions in either order gives the same sentential form. We may therefore move leftward past all intervening steps and replace the resulting adjacent fragment by the single -step . Restoring the commuted surrounding-context steps gives the same final terminal word.
Conversely, every use in of a substituted production can be expanded in to the two steps Replacing each substituted step in a derivation of a terminal word in by this two-step fragment yields a derivation in with the same yield. Hence [L2] gives .
If a terminal derivation in never uses the deleted production , then it is also a derivation in . Otherwise apply step 1.1 to one use of . This decreases by one the number of uses of the deleted production in the finite derivation without changing its terminal yield. Repeating finitely many times produces an -derivation of the same word, so [L2] gives .
The two inclusions from steps 2.1 and 1.2 prove .
Depends on
Used by
Dependency tree · two levels
4 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- CSC444 CFLs and PDAs (standard reference, not scraped)