Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: 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.

Taking out an unbounded factor needs integrability

Statement refuted

Under the AC conditional-class convention, omitting product integrability from the signed L1 taking-out rule can leave its left side undefined even when both factors are integrable and the product of the factor with the conditional mean is zero.

Facts & Assumptions

Given: The proposed signed taking-out rule with product integrability omitted; a countable atomic witness will be constructed.

[F1]

The Dirac set function is the indicator that the specified point belongs to an event. (The Dirac set function at a point)

[F2]

Each Dirac set function is a probability measure. (A Dirac set function is a probability measure)

[F3]

Countable nonnegative weighted sums are defined eventwise. (Nonnegative scalar multiples and countable weighted sums of measures)

[F4]

Nonnegative weighted sums of measures are measures. (Nonnegative scalar multiples and countable weighted sums of measures are measures)

[F5]

Integer powers at the positive base two are defined. (Integer powers am)

[F7]

A measure of total mass one is a probability measure. (Probability measures and probability spaces)

[F8]

The signed L1 conditional expectation requires an integrable real input. (Conditional expectation as an ae class)

[F9]

The taking-out rule requires integrability of the input product. (Taking out what is known)

[F10]

Integrals on the countable atomic space are sums, by increasing partial sums for nonnegative functions. (Monotone convergence for the integral)

Counterexample

technique · direct
1.1

Let Ω=N1×{1,1} with its power-set sigma-algebra. By [F5]–[F6], S=n123n=(1/8)/(11/8)=1/7. Set wn=23n1/S. These weights are positive finite numbers.

F5F6
2.1

Define P=n1wnδ(n,1)+n1wnδ(n,1). The Dirac probabilities [F1]–[F2] and weighted-sum construction [F3]–[F4] make this a measure on all subsets. Its mass is 2nwn=S/S=1, so [F7] makes it a probability measure. In particular each atom (n,s) has mass w_n.

step 1.1F1F2F3F4F7
3.1

Let G=σ((n,s)n), X(n,s)=s2n and Z(n,s)=22n. Z is finite G-measurable, X is real measurable, and [F10] evaluates their absolute moments as sums. Using [F6], EX=S1n122n=7/3 and EZ=S1n12n=7. Thus each is integrable.

step 1.1step 2.1F5F6F10
4.1

Each G-event is a union of two-point fibres. On the nth fibre the X integral is wn(2n)+wn2n=0; summing is legitimate by the finite absolute moment in step 3.1. Consequently the zero function has every defining event integral and is a version of E[XG] by [F8]. Hence ZE[XG]=0 is integrable.

step 3.1F8
5.1

But ZX(n,s)=s23n. Its positive-part integral is n1wn23n=n1(2S)1=, and the negative-part integral has exactly the same value. These sums are nonnegative integrals by [F10]. Thus the signed expectation would require infinity minus infinity; ZX is not an L1 input to [F8]. The left side E[ZXG] of [F9] is undefined in that sense although the proposed right side is zero. This proves the failure when the product-integrability hypothesis is omitted.

step 2.1step 4.1F8F9F10

Source notes

Durrett Theorem 4.1.14, printed pp.212–213, states the integrable-product hypothesis. The constructed atomic counterexample, its normalization and all moments are independently calculated here.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

53 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