Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck pass
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.

Predictable step processes are dense for the compensator L² norm

Statement

For the contract of Simple counting-process intensity and compensator contract, let PT be the predictable sigma-algebra on [0,T]×Ω and define the finite measure μ(E):=∫EYs(ω)λs(ω) (ds×P)(d(s,ω)),E∈PT. Then bounded predictable step processes are dense in L2(μ). The time-zero slice has μ-measure zero.

Facts & Assumptions

Given: The finite-horizon predictable process Yλ, its compensator AT=∫0TYsλsds with EAT<∞, and the predictable sigma-algebra convention.

[F1]

The predictable sigma-algebra is generated by time-zero sets and rectangles (s,t]×B with B∈Fs, and is contained in the product sigma-algebra. (Progressively measurable and predictable processes)

[F2]

The product measure and Tonelli theorem identify ∫Yλ d(ds×P)=EAT and give measurability of the section integrals. (The product measure of two sigma-finite measure spaces Tonelli's theorem for nonnegative measurable functions on a sigma-finite product)

[F3]

A pi-system contained in a lambda-system generates only sets in that lambda-system. (Dynkin's pi-lambda theorem)

[F4]
[F5]

Increasing nonnegative integrals converge to the integral of the limit. (Monotone convergence for the integral)

[A1]

AC is already assumed by the counting-process model contract through conditional expectation. The simple-density theorem [F4] imposes no additional choice assumption; the closure argument below requires none beyond the standing model assumptions. (The Axiom of Choice Simple counting-process intensity and compensator contract)

Proof

1.1F1F2F5given

Put f(s,ω)=Ys(ω)λs(ω). By [F1], f is product-measurable, so [F2] defines μ and gives μ([0,T]×Ω)=∫f d(ds×P)=E∫0Tf(s,ω)ds=EAT<∞. Countable additivity follows from the product measure; [F5] also gives it by monotone convergence on disjoint unions. Lebesgue measure gives μ({0}×B)=0 for every B∈F0.

2.1F1F3step 1.1givenconstruct

Let G contain the empty set, whole space, time-zero generators, and interval rectangles from [F1]. Their finite intersections are empty or generators, so G is a π-system generating PT. Let D be the sets whose indicators lie in the L2(μ)-closure of the span of generator indicators. The whole space is in D because 1(0,T]×Ω is an elementary step and the time-zero slice is null. Complements preserve D by subtraction from 1; disjoint countable unions preserve it because finite partial sums converge in L2(μ), with squared tail norm the measure of a decreasing tail tending to zero as μ is finite. Thus D is a λ-system containing G, and [F3] gives D=PT.

3.1A1F4step 2.1∎

By [F4], every L2(μ) class is an L2 limit of finite simple functions on measurable sets. Each indicator in such a simple function belongs to the closure from step 2.1, so each simple function does as well; hence the span of bounded predictable step indicators is dense in L2(μ).

Source notes

Bass states the L2 approximation of predictable integrands by bounded step integrands. The proof above supplies the density argument for this precise predictable sigma-algebra and finite compensator measure using its interval generators.

Depends on

Used by

Dependency tree · two levels

42 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