Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Time translations and mollification in Bochner Lp

Statement

Assume Countable Choice.

Let X be a real Banach space, 0<T<∞, and 1≤p<∞. For f∈Lp(0,T;X), translations are continuous in Lp on every compact subinterval of (0,T). Convolution with a scalar smooth approximate identity therefore converges to f in Lp on such subintervals. If Pk are interval partitions of [0,T] with maximum cell length tending to zero, the piecewise-constant interval averages of f converge to f in Lp(0,T;X).

Facts & Assumptions

Given: Countable Choice, a real Banach space X, 0<T<∞, 1≤p<∞, and f∈Lp(0,T;X).

[F1]

Write Lp(0,T;X) for a.e.-classes of strongly measurable functions with ∫0T∥f(t)∥Xp dt<∞. Choose the representative to be zero on its exceptional null set; the sets EN below are measurable by [F3]. Strong measurability supplies simple functions uj→f a.e. For N≥1, let EN={t:∥f(t)∥X≤N} and sN,j=uj1EN∩{∥uj∥X≤N+1}. These are simple, converge a.e. to f1EN as j→∞, and ∥sN,j−f1EN∥X≤(2N+1)1EN; dominated convergence on the finite interval gives convergence in Lp. Also f1ENc→0 in Lp by dominated convergence. Hence simple functions are dense in Lp(0,T;X). Since ∥g∥L1≤T1−1/p∥g∥Lp, this approximation also gives an integrable-simple L1 approximation, so f is Bochner integrable by its definition. The norm and integral conventions are those of Strongly measurable Banach-valued function and Bochner-integrable function, with the density argument using Dominated convergence and Holder's inequality for integrals, including the endpoint cases.

[F2]

Scalar translations are continuous in Lp(R) for 1≤p<∞ under Countable Choice (∥τhf−f∥p→0 in Lp(Rn) as h→0, for 1≤p<∞, The Axiom of Countable Choice (ACω)).

[F3]

Under Countable Choice every Lebesgue measurable set is a Borel set up to a subset of a Borel null set, and a Lebesgue measurable set has an open superset with arbitrarily small excess (L(Rn) is exactly the completion of the restriction of λn to the Borel sets, For a Lebesgue measurable set and every positive ε there is an open superset whose difference from it has outer measure below ε). Measures are continuous from below (Continuity from below for measures).

[F4]

For Bochner integrable v, ∥∫v∥X≤∫∥v∥X (Bochner integral norm inequality). Scalar Hölder and Minkowski apply to its norm, and scalar integral Minkowski gives ∥∫F(⋅,s)ds∥p≤∫∥F(⋅,s)∥pds for nonnegative measurable F with finite right side (Holder's inequality for integrals, including the endpoint cases, Minkowski's inequality for integrals, including p=∞, Minkowski's integral inequality).

[F5]

By A smooth bump between concentric Euclidean balls, choose a smooth 0≤ψ≤1 on R with ψ=1 on [−1/2,1/2] and supp⁡ψ⊂(−1,1); support is defined in The support of a function on Rn and its compactly supported Riemann integral. For δ>0, mδ:=∫Rψ(s/δ) ds satisfies δ≤mδ≤2δ, by the interval measure formula and monotonicity of the integral (A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included, Monotonicity and nonnegative homogeneity of the nonnegative integral). Thus ρδ(s):=mδ−1ψ(s/δ) is nonnegative, smooth, supported in [−δ,δ], and has integral one.

[A1]

Countable Choice is used by the scalar translation supplier [F2] and the completed-measure suppliers [F3]; the simple-function density argument above is derived locally from strong measurability and dominated convergence (The Axiom of Countable Choice (ACω)).

Proof

1.1F2givenalgebra

Let s(t)=∑j=1mxj1Ej(t) be a simple function with disjoint measurable Ej. Extend it by zero to R. By [F2], ∥1Ej(⋅−h)−1Ej∥Lp(R)→0 for each j; the triangle inequality and the finite sum show ∥s(⋅−h)−s∥Lp(R;X)→0.

1.2F1F3F4A1givenconstructalgebra

For an interval partition P, let PPf be the average of f on each cell I. By [F4], ∥ ∣I∣−1∫If∥X≤∣I∣−1∫I∥f∥X. For p>1, scalar Hölder gives ∣I∣∥ ∣I∣−1∫If∥Xp≤∫I∥f∥Xp; for p=1 the first inequality gives the same assertion directly. Summing proves contraction on Lp. To justify density for arbitrary completed Lebesgue level sets, write E=B∪N with B Borel and N contained in a Borel null set Z by [F3], after intersecting all sets with (0,T). The Borel set B∪Z differs from E by a null set. Choose an open superset O with excess less than η. The bounded open set O∩(0,T) is the union of the countably many rational-endpoint open intervals contained in it. Enumerate those intervals, and let Jm be their first m unions. By continuity from below [F3], ∣(O∩(0,T))∖Jm∣→0. Thus a finite union of intervals differs from E in measure by less than 2η for large m. Round the finitely many endpoints by continuous linear ramps, whose error is supported in intervals of arbitrarily small total length. It follows that continuous X-valued functions are dense in Lp(0,T;X) by applying this construction to the finitely many level sets of a simple approximation [F1]. For continuous g, uniform continuity gives ∥PPg−g∥Lp≤T1/psup⁡∣s−t∣≤max⁡∣I∣∥g(s)−g(t)∥X→0. Contraction now yields ∥PPf−f∥Lp≤2∥f−g∥Lp+∥PPg−g∥Lp, proving the averages assertion.

2.1A1F1F2step 1.1given

Given ε>0, choose a simple s with ∥f−s∥Lp(0,T;X)<ε/3 by [F1]. Extend both functions by zero outside (0,T). Translation is an isometry of the whole-line Bochner norm because it preserves Lebesgue measure; step 1.1 therefore gives, for all sufficiently small h, ∥f(⋅−h)−f∥Lp(R;X)≤2∥f−s∥Lp+∥s(⋅−h)−s∥Lp<ε. Restriction to compact subintervals proves the translation assertion.

3.1F3F4F5step 2.1

Extend f by zero to R and use the kernels from [F5]. Replacing the measurable level sets of simple approximants by Borel representatives modulo null sets gives a Borel version by [F3]; composing the simple approximants with s↦t−s shows the Bochner integrand is strongly measurable in s. Its Lp(R) section norm is at most 2ρδ(s)∥f∥Lp(R;X) by translation invariance and Minkowski. Scalar integral Minkowski [F4] makes the s-integral of this norm finite in Lp, so the convolution is defined for a.e. t; by linearity of the defining simple-function limit and ∫ρδ=1, ρδ∗f(t)−f(t)=∫Rρδ(s)(f(t−s)−f(t)) ds there. The Bochner norm inequality [F4] then gives ∥ρδ∗f−f∥Lp(R;X)≤∫ρδ(s)∥f(⋅−s)−f∥Lp(R;X) ds. Step 2.1 makes the translation modulus uniformly small for ∣s∣≤δ, so this bound tends to zero; restriction to compact subintervals proves the stated mollification convergence.

4.1step 1.2step 2.1step 3.1∎

Steps 1.2, 2.1, and 3.1 prove convergence of interval averages, translation continuity, and convergence of time mollifiers, respectively.

Depends on

Used by

Dependency tree · two levels

85 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