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.
High frequencies destroy uniform translation control
Statement refuted
Refuted claim. For , a bounded family in whose supports lie in one fixed bounded set (that is, a tight family) is uniformly translation continuous and relatively compact.
The witness oscillates faster and faster inside the same interval: the mass stays in a fixed bounded set, but an arbitrarily small shift reverses the sign of the oscillation and changes the function by order one.
Facts & Assumptions
Given: Countable Choice; , , and on for .
Scaling the sine power. For every , , by the substitution and -periodicity. (A linear map of sends Lebesgue measurable sets to Lebesgue measurable sets, with when is invertible and Lebesgue null when it is not)
Quarter-turn shift. for every . (Quarter-turn values and shifts by pi/2 and pi)
The necessity of translation continuity. Under Countable Choice, a relatively compact family in is uniformly translation continuous: as . (Relative compactness forces uniform translation continuity in , The Axiom of Countable Choice ())
Norms and supports of classes. , and for every . (The space as the quotient by null functions)
Counterexample
By [F1] and [F4], , and all supports lie in the fixed bounded set , so the family is bounded and tight.
Put . For both and lie in , so [F2] gives and hence ; integrating over and using [F1] with the trivial bound gives .
Hence although , so the family is not uniformly translation continuous; by [F3] it is not relatively compact in , and the refuted claim is false. Countable Choice is used by the scaling interface [F1] and the necessity lemma [F3].
Depends on
- Relative compactness forces uniform translation continuity in $L^p$
- The space $L^p(\mu)$ as the quotient by null functions
- A linear map $T$ of $\mathbb{R}^n$ sends Lebesgue measurable sets to Lebesgue measurable sets, with $\lambda_n(T[E])=|\det T|\,\lambda_n(E)$ when $T$ is invertible and $T[E]$ Lebesgue null when it is not
- Quarter-turn values and shifts by pi/2 and pi
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
54 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
- John K. Hunter, Notes on Partial Differential Equations, complete 242-page 2014 notes (standard reference, not scraped)