Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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.

Conditional lp contraction

Statement

Assume AC. For 1p, conditional expectation is a linear map from real Lp(P) to real Lp(PG) satisfying E[XG]pXp.

Facts & Assumptions

Given: AC, 1p, real XLp(P), and a conditioning sub-sigma-algebra G.

[F1]

On a finite measure space, higher Lp spaces and L-infinity embed in L1. (Finite-measure Lr includes into Lp for p<r)

[F2]

ttp is finite Borel convex for every finite p1. (Absolute real powers are Borel measurable and convex)

[F3]

Conditional Jensen applies when X and the finite convex function of X are integrable. (Conditional jensen inequality)

[F4]

Conditional expectation is linear, preserves expectation and order, and satisfies the modulus bound. (Basic algebra and order properties of conditional expectation)

[F5]

Lp elements are almost-everywhere classes of measurable representatives. (The space Lp(μ) as the quotient by null functions)

Proof

technique · direct
1.1

For p>1, [F1] with P(Ω)=1 makes X integrable; for p=1 it is integrable by assumption. Put U=E[XG]. For finite p, [F2] supplies the convex Borel function and EXp< supplies its integrability. Jensen yields UpE[XpG]. Taking expectations using [F4] gives EUpEXp and hence the norm inequality by taking the increasing positive pth root. At p=1 this is also the modulus estimate of [F4].

F1F2F3F4
2.1

If p=, let M=X. The inequalities XM+1/n for all positive integers hold outside a common null set; their limit gives XM almost surely. Conditional order and constants imply MUM almost surely. Thus UM. Equality of input representatives preserves the conditional class, so the maps are well defined on [F5]; linearity is [F4].

F1F4F5

Source notes

Durrett Theorem 4.1.11 and proof, printed pp.211–212; van der Vaart Lemma 1.9(vii), printed p.4. The infinite endpoint uses the essential bound directly.

Depends on

Used by

Dependency tree · two levels

36 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