Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Strong convergence of subcritical powers

Statement

Assume Countable Choice. Let Ω⊂Rn have finite Lebesgue measure, let 1≤q<r<∞ and m≥1, and let (uj) be a sequence in Lq(Ω;R) with uj→u in Lq(Ω;R) and sup⁡j∥uj∥Lr(Ω)<∞. Then u∈Lr(Ω), and for every 1≤s<r/m the nonlinear maps converge: ∣uj∣m−1uj⟶∣u∣m−1uin Ls(Ω). The range is nonempty only when m<r; the endpoint s=r/m is not asserted.

Facts & Assumptions

Given: Countable Choice, a finite-measure set Ω⊆Rn, exponents 1≤q<r<∞, a real number m≥1, and real-valued measurable classes uj,u on Ω with uj→u in Lq(Ω) and M:=sup⁡j∥uj∥Lr(Ω)<∞.

[F1]

Hölder inclusion on a finite-measure space. If 1≤a<b<∞ and g is measurable on the finite-measure space Ω, then g∈La whenever g∈Lb, with ∥g∥La≤∣Ω∣1/a−1/b∥g∥Lb; this is Hölder applied to ∣g∣a and the constant function 1. (Holder's inequality for integrals, including the endpoint cases, The space Lp(μ) as the quotient by null functions)

[F2]

Lyapunov interpolation. If 1≤p0<p<p1<∞, θ∈(0,1) and 1/p=θ/p0+(1−θ)/p1, then every f∈Lp0∩Lp1 lies in Lp with ∥f∥Lp≤∥f∥Lp0θ∥f∥Lp11−θ. (Lyapunov interpolation inequality for Lp norms)

[F3]

Almost-everywhere subsequences. Every sequence converging in Lq, 1≤q≤∞, has a subsequence whose representatives converge almost everywhere to a representative of the limit. (Assuming Countable Choice, Lp-convergent sequences have almost-everywhere convergent subsequences)

[F4]

Fatou's lemma. For nonnegative measurable functions fk, ∫lim inf⁡kfk≤lim inf⁡k∫fk. (Fatou's lemma)

[F5]

Mean value theorem. If f:[a,b]→R is continuous on [a,b] and differentiable on (a,b), then f(b)−f(a)=f′(c)(b−a) for some c∈(a,b). (The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a))

[F6]

Hölder's inequality for products. For conjugate exponents 1≤p,q≤∞ and measurable f,g, ∫∣fg∣≤∥f∥Lp∥g∥Lq. (Holder's inequality for integrals, including the endpoint cases)

Proof

Proof technique: Extract an almost-everywhere subsequence to obtain the Lr-bound of the limit, transfer convergence to the exponent ms<r by interpolation, and apply the pointwise mean value bound followed by Hölder.

1.1F3F4given

By [F3] fix a subsequence (ujk) convergent almost everywhere to u. Then lim inf⁡k∣ujk∣r=∣u∣r pointwise almost everywhere, so [F4] gives ∥u∥Lrr≤lim inf⁡k∥ujk∥Lrr≤Mr<∞, hence u∈Lr(Ω) with ∥u∥Lr≤M. Consequently ∥uj−u∥Lr≤∥uj∥Lr+∥u∥Lr≤2M for every j.

2.1F1F2step 1.1

Fix 1≤s<r/m and put b:=ms<r. If b=q then ∥uj−u∥Lb=∥uj−u∥Lq→0; if b<q, then [F1] gives ∥uj−u∥Lb≤∣Ω∣1/b−1/q∥uj−u∥Lq→0. If q<b<r, choose θ∈(0,1) with 1/b=θ/q+(1−θ)/r; [F2] applied to the classes uj−u∈Lq∩Lr gives ∥uj−u∥Lb≤∥uj−u∥Lqθ∥uj−u∥Lr1−θ≤∥uj−u∥Lqθ(2M)1−θ→0 by step 1.1. In both cases ∥uj−u∥Lms→0, and sup⁡j∥uj∥Lms≤∣Ω∣1/(ms)−1/rsup⁡j∥uj∥Lr<∞ by [F1], while ∥u∥Lms≤∣Ω∣1/(ms)−1/rM by step 1.1.

3.1F5F6step 2.1given∎

If m=1 then ∣uj∣m−1uj=uj and ∣u∣m−1u=u, so the claim is step 2.1 itself with b=s<r. If m>1, consider N(t):=∣t∣m−1t on R; N is differentiable with N′(t)=m∣t∣m−1, and for real a≠b every point t of the closed interval between them satisfies ∣t∣m−1≤∣a∣m−1+∣b∣m−1. By [F5] applied to N on that interval, ∣N(a)−N(b)∣≤m(∣a∣m−1+∣b∣m−1)∣a−b∣. Writing a=uj(x), b=u(x) and applying [F6] with exponents m/(m−1) and m to the product (∣uj∣m−1+∣u∣m−1)∣uj−u∣ gives ∥N(uj)−N(u)∥Ls≤m(∥uj∥Lmsm−1+∥u∥Lmsm−1)∥uj−u∥Lms, and the right-hand side tends to 0 by the bounds and convergence of step 2.1. Hence ∣uj∣m−1uj→∣u∣m−1u in Ls(Ω).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

32 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