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.
FALSE: a valid many-one reduction may reverse yes-instances and no-instances
Statement
A valid computable many-one reduction may reverse yes-instances and no-instances.
Facts & Assumptions
Given: Languages and .
A computable many-one reduction satisfies for every input , by Computable many-one reductions between languages.
Refutation
If is a many-one reduction from to , then [L1] says that and always have the same truth value. Equivalently, as well.
So a valid reduction preserves both yes-answers and no-answers relative to the chosen target language ; it does not reverse them. Reversal would mean reducing to the complement language instead. Therefore the statement is false.
Depends on
Used by
Dependency tree · two levels
3 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
- MIT 6.045J / 18.400J, Lecture 9: Mapping Reducibility and Rice's Theorem (standard reference, not scraped)