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.
Compactly supported distributions have global finite order
Example
For open and a multi-index , the distribution has compact support and global order exactly . Its order on every compact containing a neighborhood of is also exactly . The claims hold in ZF.
Facts & Assumptions
Dirac derivatives satisfy (Dirac delta and its derivatives).
Compactly supported distributions have a global finite-order cutoff estimate (Compactly supported distributions have global finite order); compactwise order means the least integer in a derivative-seminorm bound (Order of a distribution on a compact set).
A compact smooth cutoff equal to one near a point exists inside any prescribed neighborhood (Test function cutoffs and euclidean localization).
Proof
Given: and .
F1 immediately gives , an explicit global estimate of order and constant one. It vanishes on tests supported away from . To see it is nonzero on every neighborhood of , take by F3 a cutoff equal to one near and multiply it by ; its derivative at is one. Thus the support is exactly , consistent with F2's compact-support theorem.
Suppose and fix compact containing a ball about . Choose supported in the unit ball and equal to near zero, by F3. For sufficiently small , let , whose support is in . Then , whereas for every integer , [step 1.1, F1, F3] An order- bound would force a pairing of modulus one to tend to zero, a contradiction. Thus no smaller order works on , or globally. For , the upper bound and nonvanishing in step 1.1 prove exact order zero, since allowable orders are nonnegative integers. Compacts avoiding give the zero restriction, and compacts without a neighborhood of are excluded from the sharp local assertion.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
10 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
- Semyon Dyatlov, Lecture notes for 18.155 (2022) (standard reference, not scraped)