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.
Heisenberg uncertainty and Gaussian equality
Statement
Assume countable choice and let . For and , For nonzero , equality holds exactly for The zero function also gives equality.
Facts & Assumptions
Given: An integer and The Axiom of Countable Choice ().
Schwartz Parseval preserves norms (Parseval pairing on Schwartz space).
Fourier transforms derivatives to multiplication by (Fourier transform acts continuously on Schwartz space).
Translation and modulation have the stated Fourier covariance laws (Translation, modulation, linear dilation and reflection laws).
Complex finite-tuple Cauchy–Schwarz has equality exactly for one common scalar multiple when the second tuple is nonzero (Complex completeness, density, and inner product: the consumer interface).
Complex line integration by parts and interval FTC hold (Complex integration by parts on intervals and decaying lines).
The basic operations preserve Schwartz space (Basic operations are continuous on Schwartz space), and weighted derivatives are integrable in all required exponents (Schwartz derivatives are integrable).
Absolute-integrable product functions admit Fubini (Fubini's theorem for L^1 functions on a sigma-finite product).
Positive-parameter Gaussians are Schwartz (Polynomial Gaussians are Schwartz).
Proof
Put . By [F6] it is Schwartz, and [F3] gives . Translation substitution and unit modulus therefore identify , , and . It suffices to prove the zero-centre assertion for .
For each coordinate , apply [F5] along that line to and . The endpoint product tends to zero at both ends by rapid decay, and both differentiated products are line-integrable. Their full-space integrability follows from [F6] and [F4], so [F7] permits integrating the identity in the other coordinates. It yields . Sum over and define tuples , . Then By [F1] and [F2], , while . This proves the inequality with the claimed constant.
Suppose and equality holds. Step 2.1 gives , so both tuple norms are nonzero. Equality in [F4] makes for one complex scalar . Equality in the real-part bound, together with , forces to be a negative real number. Write , . The identities hold a.e., hence everywhere by continuity and the positive measure of nondegenerate boxes. Thus every partial derivative of is zero. Applying the interval FTC [F5] along successive coordinate segments shows , so . Nonzero forces . Undoing step 1.1 gives exactly the displayed form for .
Conversely let with , . By [F8] it is Schwartz, and direct differentiation gives . Thus both inequalities in step 2.1 are equalities, giving equality in the uncertainty inequality. By step 1.1 the translated and modulated functions have the same equality property. If , both sides are zero directly. The common scalar across all coordinates is essential to the radial equality assertion proved here.
Depends on
- Parseval pairing on Schwartz space
- Fourier transform acts continuously on Schwartz space
- Translation, modulation, linear dilation and reflection laws
- Complex completeness, density, and inner product: the consumer interface
- Complex integration by parts on intervals and decaying lines
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Basic operations are continuous on Schwartz space
- Schwartz derivatives are integrable
- Fubini's theorem for L^1 functions on a sigma-finite product
- Polynomial Gaussians are Schwartz
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
45 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
- Gerald Teschl, Topics in Real and Functional Analysis (2017) (standard reference, not scraped)