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 Lp Spaces and Test-Function Conventions: Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- 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
- 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
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- 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
- 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
- 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
- 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 Derivative and the Mean Value Theorems
- The Exponential Function
- 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
Three calculations illustrate the complex conventions: conjugate phase tests recover a norm that real tests miss; two step functions distinguish bilinear integration from the first-variable-linear L2 pairing; and mollification has a quantitative finite-p error while retaining an infinity-norm obstruction. The Euclidean examples retain countable choice from their measure and mollifier prerequisites.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Conjugate phases norm a three-atom function
Example
On with the full sigma-algebra and each atom of mass , let and . Then . The complex bilinear test has and . In contrast, Taking without conjugating the phase gives .
Facts & Assumptions
Given: The three-atom probability space and the explicitly displayed and .
The bilinear finite-simple dual norm equals the norm on this finite measure space (Complex Lq norm recovery from finite simple dual tests).
Complex modulus is multiplicative and satisfies the triangle inequality (Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive).
The integral of a nonnegative simple function is its coefficient-weighted sum of atom measures (The integral of a nonnegative simple function).
Real and imaginary component integration extends that formula to complex coefficients (Integrable real and complex functions, and their integrals).
Verification
Direct multiplication gives , , and . Thus all three values of have modulus one, so F3 gives . The measure is a probability measure: disjoint sets just partition three atoms, and their weighted cardinalities add to one on .
For a real test , set for . Each weight is nonnegative, summing the product over all signs gives , and summing gives . Thus . For the linear expression , F2 implies .
The conjugated test has modulus one on each atom, so its essential infinity norm is one. Coordinatewise , and F3–F4 give . Every complex test of norm at most one has integral modulus at most by F1; all tests here have finite-measure support. Hence this test attains the full complex supremum.
At the two equal-sign vertices, because . Every other sign vertex has one exceptional sign, at some coordinate , so and has modulus . For instance gives . This proves both the real upper bound and its attainment. Finally F4 gives , proving the claimed failure of the unconjugated phase.
Two-step functions expose the conjugation convention
Example
Assume countable choice and use Lebesgue measure on . Set Then , but while . Moreover and . Thus the bilinear integral is not the inner product.
Facts & Assumptions
Given: Countable choice and the two disjoint unit intervals with the displayed complex coefficients.
The pairing conjugates the second function, is linear in the first, and equals the squared norm on the diagonal (The complex pairing is well-defined and satisfies Cauchy–Schwarz).
Under countable choice each of the half-open intervals has Lebesgue measure its length, here one (A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included).
The nonnegative simple integral is the sum of values times measures (The integral of a nonnegative simple function).
Complex integrals are linear (The Lebesgue integral is linear on ).
Verification
F2 gives measure one to both intervals; they are disjoint, and both functions vanish elsewhere. Their squared moduli are each , so F3 gives . Thus both are integrable representatives.
On the first interval and on the second it is . F1 and F4 therefore give . The bilinear product instead has value on each interval, so .
The coefficients of are and those of are , so has values . Hence . The coefficients of are , so has values and . These computations agree with first-variable linearity and second-variable conjugate-linearity and show concretely why the bilinear expression cannot replace the inner product.
Mollification of a complex two-step function
Example
Assume countable choice. Let be nonnegative, supported in , and satisfy . Put and . Then This is smooth, is supported in , and tends to in each finite , with Its essential-supremum error is at least : every continuous function on has essential-supremum distance at least from this .
Facts & Assumptions
Given: Countable choice, the specified real nonnegative mass-one smooth kernel, , and the displayed complex two-step function.
Real mollifiers smooth locally integrable complex inputs, send compactly supported inputs to compactly supported outputs, and their scalings have mass one (Complex translation, convolution, approximate identities, and mollification).
The complex Lp norm is the quantity induced by the modulus and is well-defined on a.e. classes (Complex Holder, Minkowski, and the quotient norm).
Under countable choice interval measures equal their lengths, including all endpoint conventions (A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included).
A finite union has measure at most the sum of its component measures (Finite and countable subadditivity of measures).
The nonnegative integral is monotone and positively homogeneous (Monotonicity and nonnegative homogeneity of the nonnegative integral).
The simple integral is the value-weighted sum of the measures of disjoint fibers (The integral of a nonnegative simple function); on nonnegative simple functions it equals the nonnegative Lebesgue integral (The nonnegative integral agrees with the simple integral on simple functions).
Verification
The input is bounded and supported in , so F3 makes it integrable and locally integrable. In the convolution integral, has real part one exactly for and imaginary part one exactly for . Integrating the two components gives the displayed formula. Their common endpoint has measure zero by F3. F1 makes the output smooth. Since vanishes outside , both integrals vanish for and for , proving the stated support inclusion.
For , put . Outside , the entire interval stays in a constant region of , so the unit kernel mass from F1 implies . Each component of the convolution is between zero and one, because and its integral is one. The same is true for each component of , including its value at the shared endpoint. Consequently the modulus error is at most everywhere and is zero outside . F3–F4 give . Since , F5–F6 and the definition of in F2 give . Taking p-th roots proves the bound, and its limit is zero for each fixed finite .
Let be any continuous complex function. If , choose a real essential bound for the error. On the function is zero, so a.e.; by continuity this inequality holds throughout that interval, since any failure persists on an open interval of positive measure by F3. Similarly throughout . Taking the respective limits at zero gives and , whence , a contradiction. Thus every such has error at least , in particular the smooth function from step 1.1.