Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck 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=1k−112j2, and the functions fk:=k χIk.

[L1]

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

Refutation

technique · direct
1.1L1algebra

The intervals Ik are pairwise disjoint and lie in [0,1] because ∑k=1∞12k2<1. Also ∫∣fk∣ dλ=kλ(Ik)=12k.

2.1step 1.1L1algebra

If M>0 and k≤M, then {∣fk∣>M}=∅; if k>M, then {∣fk∣>M}=Ik and ∫{∣fk∣>M}∣fk∣ dλ=12k≤12⌊M⌋+2. Therefore the family (fk) is uniformly integrable by [L1].

2.2step 1.1algebra

If an integrable function g satisfied g≥fk almost everywhere for every k, then ∣g∣≥g≥k almost everywhere on Ik. Since the intervals are pairwise disjoint, ∫∣g∣ dλ≥∑k=1∞∫Ik∣g∣ dλ≥∑k=1∞kλ(Ik)=∑k=1∞12k=+∞, contradicting integrability of g. Hence no single integrable majorant exists.

3.1step 2.1step 2.2∎

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

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