Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 2026-08-28
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.

FALSE: uniform integrability implies domination by one integrable function

Statement refuted

uniform integrability implies domination by one integrable function.

Facts & Assumptions

Given: On [0,1] with Lebesgue measure, the pairwise disjoint intervals Ik:=[ak,ak+12k2), where ak:=j=1k112j2, and the functions fk:=kχIk.

[L1]

Uniform integrability means that for every ε>0 there is M>0 such that {fk>M}fkdμ<ε for every k. (A uniformly integrable family)

Refutation

technique · direct
1.1

The intervals Ik are pairwise disjoint and lie in [0,1] because k=112k2<1. Also fkdλ=kλ(Ik)=12k.

L1algebra
2.1

If M>0 and kM, then {fk>M}=; if k>M, then {fk>M}=Ik and {fk>M}fkdλ=12k12M+2. Therefore the family (fk) is uniformly integrable by [L1].

step 1.1L1algebra
2.2

If an integrable function g satisfied gfk almost everywhere for every k, then ggk almost everywhere on Ik. Since the intervals are pairwise disjoint, gdλk=1Ikgdλk=1kλ(Ik)=k=112k=+, contradicting integrability of g. Hence no single integrable majorant exists.

step 1.1algebra
3.1

This uniformly integrable family is not dominated by any integrable function, so the claim is false.

step 2.1step 2.2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

3 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