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 be the predictable sigma-algebra on and define the finite measure Then bounded predictable step processes are dense in . The time-zero slice has -measure zero.
Facts & Assumptions
Given: The finite-horizon predictable process , its compensator with , and the predictable sigma-algebra convention.
The predictable sigma-algebra is generated by time-zero sets and rectangles with , and is contained in the product sigma-algebra. (Progressively measurable and predictable processes)
The product measure and Tonelli theorem identify 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)
A pi-system contained in a lambda-system generates only sets in that lambda-system. (Dynkin's pi-lambda theorem)
Finite-measure simple functions are dense in . (Simple functions with finite-measure support are dense in for )
Increasing nonnegative integrals converge to the integral of the limit. (Monotone convergence for the integral)
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
Put . By [F1], is product-measurable, so [F2] defines and gives . Countable additivity follows from the product measure; [F5] also gives it by monotone convergence on disjoint unions. Lebesgue measure gives for every .
Let contain the empty set, whole space, time-zero generators, and interval rectangles from [F1]. Their finite intersections are empty or generators, so is a -system generating . Let be the sets whose indicators lie in the -closure of the span of generator indicators. The whole space is in because is an elementary step and the time-zero slice is null. Complements preserve by subtraction from ; disjoint countable unions preserve it because finite partial sums converge in , with squared tail norm the measure of a decreasing tail tending to zero as is finite. Thus is a -system containing , and [F3] gives .
By [F4], every class is an 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 .
Source notes
Bass states the 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
- Simple counting-process intensity and compensator contract
- Progressively measurable and predictable processes
- The space $L^p(\mu)$ as the quotient by null functions
- The product measure of two sigma-finite measure spaces
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
- Dynkin's pi-lambda theorem
- Simple functions with finite-measure support are dense in $L^p(\mu)$ for $1 \le p < \infty$
- Monotone convergence for the integral
- The Axiom of Choice
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
- Richard F. Bass, SDEs with Jumps, Section 2.5, PDF p. 5 (standard reference, not scraped)