Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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.

An unbounded predictable transform may lose integrability

Statement refuted

Assume AC. Predictability of finite real H and boundedness of a martingale M do not ensure integrability of the algebraic gain k=1nHk(MkMk1). The following gain is finite at every point and fails the integrable-transform domain already at time one.

Facts & Assumptions

Given: The hypotheses and conventions in the statement refuted.

[F1]

Nonnegative finite and countable weighted sums of measures are measures. Nonnegative scalar multiples and countable weighted sums of measures are measures.

[F2]

A Dirac measure at a specified point is a probability measure. A Dirac set function is a probability measure.

[F3]

Under AC every integrable input has a measurable integrable conditional version. Conditional expectation as an ae class.

[F4]

A known integrable variable conditions to itself; an independent one conditions to its mean. Conditioning a known variable and an independent variable.

[F5]

Increasing nonnegative measurable limits pass through integrals. Monotone convergence for the integral.

[F6]

AC supplies the inherited conditional-expectation existence and any stated choice of versions. The Axiom of Choice.

[F7]

Every product increment must be integrable for an integrable transform. Discrete martingale transform.

Counterexample

technique · direct
1.1

Let Ω={(j,e):j1, e{1,1}} with its full power-set sigma-algebra and masses P{(j,e)}=2j1. The weighted Dirac sum is a measure by [F1]–[F2]. Its first m two-point blocks have total mass j=1m2j=12m, by multiplying the finite sum by two and subtracting; since 2mm+1, its limit is one. Hence P(Ω)=1. Let F0 be all unions of the blocks Bj={(j,1),(j,1)} and Fn the full power set for n1. Complements and countable unions preserve block unions, so this is a filtration.

F1F2
2.1

Set M0=0, Mn(j,e)=e for n1. These variables are adapted and bounded by one. For any AF0, its positive-sign and negative-sign portions have equal probability: each equals j:BjA2j1. Thus AedP=0, a finite subtraction, so the zero function meets all CE event identities. Consequently E[M1F0]=0=M0. At later times Mn+1=Mn=e is already known and integrable, so it conditions to itself. Thus M is a bounded martingale Martingale submartingale and supermartingale.

F3F4step 1.1
3.1

Define H1(j,e)=2j and Hk=0 for k2. Every value is finite, H1 is constant on each block and hence F0-measurable, and later H values are known constants. Thus H is predictable Predictable discrete time process and unbounded. The algebraic gain at every positive time is Gn(j,e)=2je. For fm=2j1{jm}, the finite simple integral is Efm=j=1me=±12j2j1=m. To justify the limiting step locally, augment every finite disjoint simple display by its complement with coefficient 0; intersections of two augmented displays partition Ω and carry equal coefficients, so finite additivity and 0(+)=0 prove representation independence. Common refinements give monotonicity. For any 0uru, a simple su, and 0<c<1, the sets Ar={urcs} increase to Ω, including on the zero level of s, and continuity from below for the finite-sum measure AAs gives cssuprur. Let c1 and take the supremum over s to obtain MCT. Applying this to fmG1 gives EG1=. Hence the product at time one is not integrable and violates [F7], and the gains cannot be a martingale. No signed conditional expectation of G1 is formed. AC is inherited only from the CE notation used for the bounded M; all masses and factors are explicit.

F5F6F7step 1.1step 2.1construct

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

41 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