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.
Complex Riesz–Thorin Endpoint Interpolation: Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Analyticity of Holomorphic Functions; Liouville and Morera
- Arc Length and Rectifiable Curves
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Variation and the Riemann–Stieltjes Integral
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Differentiability and the Cauchy–Riemann Equations
- Complex Lp Spaces and Test-Function Conventions
- Complex Power Series and Analytic Functions
- Complex Riesz–Thorin Endpoint Interpolation
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Contour Integration
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Goursat's Theorem and Cauchy's Theorem in a Convex Domain
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Line Integrals and the Gradient Theorem
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Fundamental Theorems of Calculus
- The Identity Theorem, the Maximum Principle and the Open Mapping Theorem
- The Inverse and Implicit Function Theorems
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
A two-by-two matrix and a probability averaging operator give explicit endpoint estimates and their interpolated consequences. The parameter p=4/3 illustrates the conjugate exponent and constant. Unit-L1 spikes on the Lebesgue interval show that finite-target hypotheses do not imply an unasserted infinity endpoint.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Interpolation for the two-by-two Hadamard matrix
Example
For two-point counting measure, the matrix acts by . Its norm is 1 and its norm is . For its norm is at most .
Facts & Assumptions
On counting measure the Lp norms are the corresponding finite sums or essential maximum Complex Lp classes and Euclidean test-function conventions.
A complex-linear core map with endpoint bounds A and B has the stated conjugate-exponent bound Interpolate L1 to Linfinity and L2 to L2 bounds.
Verification
Given: The objects and hypotheses in the statement.
Counting measure assigns masses to the four subsets and is countably additive because a disjoint family has at most two nonempty members. Every complex tuple is a finite simple function and H is complex-linear. The complex Lp conventions give , , and . Since , the first operator norm is at most one; the input (1,0) has input norm one and output (1,1) of infinity norm one, so the norm is exactly one.
Expanding with complex conjugates gives , since the two cross terms cancel. Hence , proving the second operator norm exactly. For , apply F2 with A=1 and B=sqrt(2): . The endpoints are the two direct calculations.
The Hausdorff–Young exponent arithmetic
Example
For any sigma-finite-space complex-linear core operator with bounds of constant A and of constant B, the value gives target exponent 4 and bound . The endpoint targets at p=1 and p=2 are respectively infinity and two.
Facts & Assumptions
The abstract endpoint bound uses theta=2-2/p and the target conjugate exponent Interpolate L1 to Linfinity and L2 to L2 bounds.
Verification
Given: The objects and hypotheses in the statement.
At , , , and , so . The bound in F1 becomes . For instance A=B=1 gives coefficient one.
At p=1 the reciprocal target exponent is , giving infinity and the hypothesis . At p=2 it is , giving two and . These direct endpoint statements remain meaningful for A=0 or B=0, while the interior square-root coefficient is zero if either vanishes. No Fourier operator or its endpoint bounds are being presumed.
Finite target bounds do not supply an infinite target bound
Statement refuted
The implication “ and core bounds entail a bounded core estimate” is false, even with both given constants equal to one. Assume countable choice for the cited Lebesgue measure construction.
Facts & Assumptions
The Lp norms of complex simple functions are given by the integrals of their moduli and their essential bounds Complex Lp classes and Euclidean test-function conventions.
Under countable choice an open interval has measure equal to its length A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included.
Countable choice is assumed for the preceding interval-measure result The Axiom of Countable Choice ().
The complex norm is well-defined on a.e. classes Complex Holder, Minkowski, and the quotient norm.
For every real bound there is a larger natural number Every complete ordered field is Archimedean.
Counterexample
Given: The objects and hypotheses in the statement.
Use Lebesgue measure on (0,1) and let T be the identity on complex finite simple classes. It is complex-linear and has and . Countable choice supplies the stated earlier Lebesgue-measure result, which gives measure one to (0,1) and measure to for each integer .
Define . It is a finite simple function of finite-measure support. Direct integration gives and . Its infinity norm is n: n is a pointwise bound, and every smaller nonnegative bound fails on a set of measure . Thus an bound C would require for every , impossible for finite C.
Interpolation of an averaging operator on a probability space
Example
On a probability space define for complex finite simple f. This is a complex-linear operator with and norms at most one. Consequently for .
Facts & Assumptions
The absolute value of an integrable function’s integral is at most the integral of its modulus The modulus of an integral is bounded by the integral of the modulus.
Complex Cauchy–Schwarz bounds the pairing with the constant one The complex pairing is well-defined and satisfies Cauchy–Schwarz.
The core endpoint estimates interpolate to the conjugate-exponent estimate Interpolate L1 to Linfinity and L2 to L2 bounds.
Verification
Given: The objects and hypotheses in the statement.
Every finite simple function on a probability space is integrable; finite sums in its integral show that P is complex-linear. The constant one has every displayed norm equal to one. Hence by the integral triangle inequality. In particular , so the bound is attained on this input.
Complex Cauchy–Schwarz against the constant one gives . Every probability space is sigma-finite, with the constant exhaustion X, so F3 applies with A=B=1 to give for interior p. The endpoint estimates are the two calculations above.