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.
Compatible extensions from the finite simple core
Statement
Assume countable choice and the hypotheses and measure-space alternatives of Riesz–Thorin estimate on the finite simple core. For each its core operator extends uniquely to a bounded complex-linear map with the interpolated bound for interior theta and the original bound at either endpoint. Every two extensions agree as measurable a.e. classes on their domain intersection. Thus defines a well-defined linear map on , and each interpolated extension is its restriction.
Facts & Assumptions
The core map has a finite interpolated norm bound and the given endpoint bounds Riesz–Thorin estimate on the finite simple core.
Under countable choice every complex Lq is complete and norm convergence has an a.e.-convergent subsequence, including q=infinity Complex Lp completeness and almost-everywhere subsequences.
Finite simple functions with finite-measure support are dense for finite input exponents on every measure space Complex finite-simple and smooth compact-support density for finite p.
Countable choices of approximants and representatives are permitted The Axiom of Countable Choice ().
The quotient norms are homogeneous and satisfy the triangle inequality Complex Holder, Minkowski, and the quotient norm.
Pointwise convergence under an integrable majorant gives convergence of the integrals of the nonnegative errors Dominated convergence.
The integer part uniquely specifies rounding to a mesh; positive values round down and negative values round up toward zero Integer part: for every real there is exactly one integer with .
Integral monotonicity bounds the measures of positive level sets by finite moments Monotonicity and nonnegative homogeneity of the nonnegative integral.
Products of positive bases and iterated real powers obey the exponent laws The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents.
The real exponential is continuous and strictly increasing The exponential function is strictly increasing.
For positive t, exp(log t)=t, so strict increase gives log t positive above one and negative below one The natural logarithm as the inverse of the exponential function.
Positive real powers are exp of the exponent times the logarithm; zero to a positive power is zero Real powers for positive bases, with the zero-base positive-exponent convention.
Proof
Given: The objects and hypotheses in the statement.
Fix theta, put and , and denote its finite core bound by K (the stated endpoint bound when theta is an endpoint). Density and countable choice give finite simple for with for any fixed . The bound makes Cauchy. Completeness, with its stated countable-choice hypothesis, gives a limit; define to be that limit.
To compare parameters a,b, fix a finite-valued measurable representative . For , set . This set has finite measure because . On , round each real and imaginary component toward zero to a multiple of , and put elsewhere. The rounding has finitely many values because the components are bounded by n; its fibers are measurable intervals, and its support lies in . Also . At a point with f nonzero, it eventually belongs to and the rounding error is at most ; at a zero of f every is zero. Thus pointwise and for j=a,b. Dominated convergence applied to these errors gives simultaneous convergence in both source norms.
If is a second core approximation converging to f, , so the definition is independent of approximation. Approximate f and g separately; approximates , and core linearity gives linearity of the limits. Norm continuity gives . Any bounded extension has the same limit on a dense core, proving uniqueness. This includes K=0.
By step 2.1, the one sequence converges in to and in to . The a.e.-subsequence theorem first gives a subsequence converging a.e. to a representative of ; apply it again to that subsequence in to get a further subsequence converging a.e. to . Choosing representatives and taking the countable union of their measurable null discrepancies makes the two pointwise limits comparable on one conull set. Uniqueness of complex pointwise limits gives as classes. The supplier covers q=infinity as well.
If with endpoint components, then lies in . Agreement gives , so . Componentwise addition and scalar multiplication prove linearity of this sum map.
If and , split , . For , ; since exp is increasing and , has the sign of . Thus powers increase with the exponent for and decrease for ; at all positive powers are zero. On the first set , and on the second . Thus and . Pairwise agreement and linearity give . If , reverse the endpoint labels in this split. If they coincide, f is already in both endpoint spaces. This proves the restriction assertion for all theta, including the endpoints.
Depends on
- Riesz–Thorin estimate on the finite simple core
- Complex Lp completeness and almost-everywhere subsequences
- Complex finite-simple and smooth compact-support density for finite p
- Complex Holder, Minkowski, and the quotient norm
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Dominated convergence
- Integer part: for every real $x$ there is exactly one integer $m$ with $m \le x < m + 1$
- Monotonicity and nonnegative homogeneity of the nonnegative integral
- The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents
- The exponential function is strictly increasing
- The natural logarithm as the inverse of the exponential function
- Real powers for positive bases, with the zero-base positive-exponent convention
Used by
Dependency tree · two levels
67 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
- Teschl Corollary 15.3 p.415 and sum-space discussion p.413; Laugesen Remark C.7(2)–(3) pp.169–170 and proof conclusion pp.172–173 (standard reference, not scraped)