Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Dunford--Pettis: dominated and concentrating families

Example

Assume the Axiom of Choice, and let I=[0,1] carry restricted Lebesgue measure. Two contrasting families in real L1(I) are as follows.

  1. If gL1(I) is nonnegative and Kg{fL1(I):fg almost everywhere}, then Kg is uniformly integrable and relatively weakly compact.
  2. The concentrating sequence fn=n1(0,1/n), n1, is bounded in L1(I) but is neither uniformly integrable nor relatively weakly compact.

Facts & Assumptions

[L2]

Real L1 consists of almost-everywhere classes with the integral norm, and the integral of a nonnegative simple function is its finite weighted sum (The space Lp(μ) as the quotient by null functions, The Lp norm descends to the quotient and makes Lp a normed space for 1p, The integral of a nonnegative simple function).

[L3]

Every individual L1 function has absolutely continuous integral (Absolute continuity of the integral).

[L4]

Under AC, a family in real L1 on a finite measure space is relatively weakly compact exactly when it is uniformly integrable, equivalently norm bounded with uniformly absolutely continuous integrals (Dunford--Pettis for real L1 on a finite measure space).

Verification

technique · counterexample

Given: AC, the restricted Lebesgue interval, a nonnegative gL1, a dominated family Kg, and the displayed spike sequence.

1.1

Fix the finite quotient-space model. Let λI(E)=λ(EI) on the ambient Lebesgue sigma-algebra. By [L1] this is a finite measure with λI(I)=1. We use the quotient L1(λI) from [L2], so changes outside I or on null endpoints do not change a class.

givenA1L1L2
2.1

Prove uniform integrability of the dominated family. For fKg, domination gives f1Ig, uniformly in f. Given ε>0, [L3] supplies δ>0 such that λI(E)<δ implies Eg<ε. Then EfEg<ε for every fKg. Thus the two conditions in [L4] hold, so Kg is uniformly integrable and relatively weakly compact.

L2L3L4step 1.1
2.2

Calculate the concentrating sequence. For every n1, the nonnegative simple-integral formula and interval length give

L1L2step 1.1construct

fn1=nλI((0,1/n))=n1n=1.

Hence (fn) is L1 bounded. But for En=(0,1/n) one has λI(En)=1/n0 while Enfn=1.

3.1

Fail uniform integrability and weak compactness. Taking, for example, ε=1/2, step 2.2 shows that no single δ>0 works for the uniform absolute-continuity condition: choose n>1/δ. Therefore the family {fn:n1} is not uniformly integrable. The reverse implication in [L4] then shows that it is not relatively weakly compact.

A1L4step 2.2
4.1

Audit the endpoints and degenerate families. [A1, L1, L2, L3, L4, step 1.1, step 2.1, step 2.2, step 3.1] If Kg=, both conclusions in part 1 are vacuous. If g=0, every dominated L1 class is zero, so the conclusion is the compact singleton case. Open, closed, or half-open spike intervals define the same class because their endpoint differences are null. The spikes are real and nonnegative; their obstruction is concentration on shrinking positive-measure sets, not unbounded L1 norm. AC is used exactly through [L4] and to supply the Countable Choice in the Lebesgue model [L1].

givenA1L1L2L3L4step 1.1step 2.1step 2.2step 3.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

75 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