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.
Counting-process compensators, integrals, brackets
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Variation and the Riemann–Stieltjes Integral
- Brownian Motion Construction and Continuity
- Brownian Motion, Markov Properties and Hitting Times
- Central Limit Theorems
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Conditional Expectation
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Discrete Time Martingales
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Infinite Product Measures and Kolmogorov Extension
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Martingale Inequalities and Convergence
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Suprema and Infima
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Ito Integral with Respect to Brownian Motion
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral: Definition and Integrability
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
On a finite horizon, the page defines a simple unit-jump counting process, predictable at-risk and intensity processes, and a continuous compensator . The contract explicitly assumes is a square-integrable martingale; an intensity formula alone is not a compensator-existence theorem. The Axiom of Choice is inherited where conditional expectation is used.
The local bracket argument proves , , and is a martingale. Bounded predictable step integrals are proved to be square-integrable martingales with the compensator isometry. Completion extends the integral only to predictable with . For finitely many processes on a common filtration, no simultaneous jumps imply zero optional and predictable cross brackets; independence is not assumed. No general jump-semimartingale integral, local-martingale extension, unbounded-energy claim, or process-level limit is included.
3 · Logical flowchart
4 · Definitions, theorems and proofs
A continuous finite-variation martingale is constant
Statement
Let be a continuous martingale relative to a filtration , with . Suppose each path has finite total variation and . Then is indistinguishably zero on .
Facts & Assumptions
Given: A finite horizon , a filtered probability space, and a continuous adapted martingale with and integrable pathwise total variation.
The all-pairs martingale identity holds at every , and the continuous-path hypothesis supplies a measurable probability-one event on which each path of is continuous. (Continuous-time adapted processes and martingales)
A bounded -measurable factor can be taken outside conditional expectation given . (Taking out what is known)
Dominated convergence passes limits through integrals under an integrable majorant. (Dominated convergence)
Total variation bounds every partition sum of absolute increments. (Bounded variation and total variation on an interval)
Every finite closed interval is compact. (Heine-Borel by bisection: every closed bounded interval is compact)
A continuous real function on a compact subset of is uniformly continuous. (Heine-Cantor in : a continuous real function on a compact subset of is uniformly continuous)
A nonnegative random variable with expectation zero vanishes almost surely. (A nonnegative measurable function has integral exactly when it vanishes almost everywhere)
Indistinguishability means equality for every time outside one measurable probability-one event. (Process law, modification, and indistinguishability)
AC is inherited from the conditional-expectation interface used by the continuous-time martingale definition. (The Axiom of Choice)
Proof
Fix and define and The explicit piecewise formula gives ; is bounded by and is -Lipschitz, while and exactly when . Splitting an interval at and if needed and using the Lipschitz bound gives, for all ,
Fix and deterministic partitions with mesh tending to zero. Put Each coefficient is bounded and -measurable. The martingale identity and [F2] give . The estimate of step 1.1 and the total-variation bound [F4] imply On the probability-one continuity event in [F1], compactness [F5] and Heine--Cantor [F6] make the maximum increment tend to zero. Thus almost surely, since . Also , an integrable bound by the hypothesis. Dominated convergence [F3] yields . Since is nonnegative and vanishes only at zero, [F7] gives almost surely.
The conclusion also holds at because . For every rational , step 2.1 gives a measurable probability-one event on which . Intersect these countably many events with the probability-one continuity event from [F1]. On the resulting measurable probability-one event, continuity and density of the rationals give for every . By [F8], is indistinguishably zero.
Source notes
Bass's Section 2.3 discusses càdlàg martingale decompositions and the jump-bracket framework. The bounded-integrand partition argument above supplies the finite-horizon finite-variation martingale proof used here.
Bounded stopping preserves càdlàg square-integrable martingales
Statement
Let be a square-integrable all-pairs martingale with right-continuous paths with left limits for every , and let be a stopping time. Then the stopped process is a square-integrable martingale on .
Facts & Assumptions
Given: A finite horizon, a square-integrable all-pairs martingale with pathwise càdlàg paths, and a bounded stopping time .
On , use the adaptedness, all-pairs conditional-expectation identity and pointwise conditions of Continuous-time adapted processes and martingales with times restricted to this interval. This agrees with its convention: extend and the filtration by and . For the extended martingale identity is ; for it is the known-variable identity, and for it is the given identity. Thus this extension is a square-integrable martingale, without any filtration augmentation.
A map is a stopping time when . (Continuous-time stopping times and stopped sigma-algebras)
The absolute value of a martingale is a nonnegative submartingale, and the finite discrete-time Doob inequality bounds its grid maximum by twice the terminal norm. (Absolute value and powers of a martingale are submartingales Doob Lp maximal inequality)
Dominated convergence passes limits through event integrals. (Dominated convergence)
Increasing nonnegative integrals converge to the integral of the limit. (Monotone convergence for the integral)
AC is inherited through the conditional-expectation interface in [F1]. (The Axiom of Choice)
Proof
Let be nested finite partitions of containing any fixed with mesh tending to zero. For each , the values of on its grid form a discrete-time nonnegative submartingale by [F1, F3]. The Doob bound gives . Càdlàg paths and the nested dense grids imply ; [F5] then gives .
For a finite partition , round up to the first grid point . This is a finite-valued stopping time because . At adjacent grid points, ; the indicator is -measurable. Conditioning each increment on its left endpoint proves the stopped grid values have the martingale identity at grid times, in particular at .
Refine the partitions while keeping as grid points. Then , and pathwise right continuity gives and . For or , the events with grid value lie in , and their complement is also in ; expressing over these finitely many events proves -measurability. The pointwise limits are then measurable there without completing the filtration. Both are dominated by , integrable by step 1.1. For each , apply [F4] to the event-integral martingale identity from step 1.2; it yields , hence the stopped process satisfies the all-pairs martingale identity. Also gives square integrability.
Source notes
Bass discusses martingale jump decompositions and stopped martingales. The finite-grid approximation above gives the bounded-stopping argument under this library's uncompleted filtration convention without assuming the usual conditions on the filtration.
Simple counting-process intensity and compensator contract
Definition
Assume the Axiom of Choice The Axiom of Choice. Fix a finite horizon , a probability space and a continuous-time filtration in the all-pairs convention of Continuous-time filtrations and all-pairs martingales. A simple unit-jump counting process is an adapted, càdlàg (right-continuous with left limits), nondecreasing, integer-valued process with , almost surely, and for every outside one null event; here .
An at-risk process is a predictable process , and an intensity density is a finite, nonnegative predictable process . Form the Lebesgue integral For this model and every nonnegative predictable process , define the pathwise energy integral by The continuous intensity compensator contract requires the defining integral for to be finite pathwise, and requires to be continuous, adapted and predictable with , and that . Set . The model contract is the additional hypothesis that is a square-integrable martingale relative to the stated filtration. Under this contract is a continuous predictable compensator of .
The displayed intensity density alone does not assert that is a martingale, that such a process exists for a given , or that the contract follows from an empirical observation scheme. No general compensator-existence theorem is included here. The Axiom of Choice is inherited from the continuous-time martingale and conditional-expectation interfaces; no further choice is used to state the model contract.
Source notes
Tian's Unit 8 sets up the one-event process, at-risk indicator and integrated hazard; Andersen–Borgan–Gill–Keiding define the counting-process compensator as a predictable finite-variation process for which is a local martingale. This library contract strengthens that model clause to a square-integrable martingale and imposes for the isometry developed below. It makes no existence claim from an intensity formula.
Optional and predictable brackets for counting-process martingales
Definition
Work on the finite horizon of Simple counting-process intensity and compensator contract. For càdlàg (right-continuous with left limits) finite-variation processes starting at zero, with and , define their optional quadratic covariation by and write . The series is absolutely convergent because each path has finite variation. This is the jump-sum convention for optional brackets used on this page.
For a square-integrable model martingale from Simple counting-process intensity and compensator contract, a continuous predictable bracket is a continuous, predictable, increasing process with , , and a martingale, when such a process exists. For two square-integrable model martingales and from that contract, a continuous predictable cross bracket is a continuous, predictable finite-variation process with , , and a martingale, when such a process exists. The uniqueness lemma below fixes the meaning of “the” bracket in this continuous compensator class. No general bracket-existence theorem is asserted. The Axiom of Choice is inherited through the model martingale's conditional-expectation interface; this definition makes no further choice.
Source notes
Tian states the continuous-compensator bracket identities for counting process martingales and explicitly refers their general proofs elsewhere. Bass gives the jump-square convention and product formula for semimartingales with jumps. The local results below prove the particular existence and identities required by this page.
Elementary predictable integral against a counting-process martingale
Definition
Let be a square-integrable martingale on a finite horizon in the all-pairs convention of Continuous-time adapted processes and martingales (in particular, it may be the compensated counting-process martingale of Simple counting-process intensity and compensator contract). Let be a deterministic partition, and let each bounded random variable be -measurable. The associated bounded predictable step integrand is at time and on . For this chosen step representation define, for , This is a finite sum of square-integrable random variables. At this stage the representation is part of the input; representation independence and the isometry are established in Isometry for elementary predictable counting-process integrals ↗. The Axiom of Choice is inherited from the all-pairs martingale and conditional-expectation interface; the finite-sum definition makes no additional choice.
Source notes
The displayed finite-sum convention agrees with Tian's bounded predictable step-integral construction and Bass's construction for jump martingales. The local martingale and isometry properties are proved separately below.
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.
L² counting-process integral when the limit exists
Definition
For the compensator contract on , let be a predictable real process with When the elementary integrals of a sequence of bounded predictable step processes converging to in this norm converge in , denote the resulting class at time by The definition is conditional on existence of the limit. The L²-extension theorem below proves existence for every such predictable , independence from the approximating sequence, the martingale property, and the isometry. The Axiom of Choice is inherited through the conditional-expectation and -completion interfaces used by that theorem.
Source notes
Bass describes the construction of the jump-martingale stochastic integral as the completion of elementary predictable integrals. This local definition states the domain through the actual compensator and leaves the existence claim to the following theorem.
Uniqueness of continuous predictable brackets
Statement
Let be an adapted process on . Suppose are continuous, predictable finite-variation processes with , , and both and are martingales. Then and are indistinguishable.
Facts & Assumptions
Given: The hypotheses of the Statement and the continuous predictable compensator convention of Optional and predictable brackets for counting-process martingales.
A continuous finite-variation martingale with integrable total variation and initial value zero is indistinguishably zero. (A continuous finite-variation martingale is constant)
A martingale is an adapted integrable process satisfying the all-pairs conditional-expectation identity. (Continuous-time adapted processes and martingales)
Conditional expectation is linear, so differences of martingales are martingales. (Basic algebra and order properties of conditional expectation)
Indistinguishability means equality for all times outside one probability-one event. (Process law, modification, and indistinguishability)
AC is inherited from the conditional-expectation interface in [F2]. (The Axiom of Choice)
Proof
The difference is a martingale by [F3]. It is continuous, has finite variation, starts at zero, and , so it satisfies [F1].
By [F1], is zero outside one probability-one event, which is indistinguishability by [F4]. Hence indistinguishably, proving uniqueness for both scalar and cross-bracket compensators in the stated continuous class.
Source notes
The cited sources formulate predictable brackets through predictable compensators. The local uniqueness proof reduces that convention to the finite-variation martingale lemma, rather than assuming a continuous-time Doob–Meyer uniqueness result not otherwise supplied on this page.
Elementary predictable counting-process integrals are martingales
Statement
Let be any square-integrable martingale on , and let be a bounded predictable step integrand on a deterministic partition. The elementary integral of Elementary predictable integral against a counting-process martingale is a square-integrable martingale.
Facts & Assumptions
Given: A finite-horizon square-integrable martingale and a bounded step integrand on a deterministic partition.
A square-integrable all-pairs martingale is adapted, integrable, and satisfies the conditional-expectation identity at every time pair. (Continuous-time adapted processes and martingales)
The elementary integral is the finite sum of the step coefficients times the corresponding increments of . (Elementary predictable integral against a counting-process martingale)
A bounded measurable factor known at time can be taken out of conditional expectation given . (Taking out what is known)
AC is inherited through the continuous-time conditional-expectation definition. (The Axiom of Choice)
Proof
Each summand in [F2] is -measurable at its current endpoint. It is square-integrable because is bounded and each martingale increment is in . A finite sum is therefore adapted and square-integrable at every .
Fix and . Refine the original deterministic partition by inserting and . After subtracting from , each remaining piece has the form on an interval with and . Thus is bounded and -measurable. Since , [F3] gives . Summing the finitely many pieces yields . The event-integral characterization of conditional expectation proves . Thus the elementary integral is a square-integrable martingale.
Source notes
Tian states the bounded predictable-integral martingale result on Unit 10 p. 5 and refers its proof to Fleming–Harrington. Bass constructs the same step integral for jump martingales. The event-testing argument above supplies the complete finite-sum proof used here.
Finite-variation integration by parts for counting-process martingales
Statement
Let be càdlàg (right-continuous with left limits) and of finite total variation. For any deterministic partitions of with mesh tending to zero, and each fixed , put . Then and the left-endpoint sums satisfy
Facts & Assumptions
Given: A càdlàg real path of finite variation on , the jump-sum convention for , and deterministic partitions whose mesh tends to zero.
For finite-variation càdlàg paths, is the absolutely convergent jump-square sum. (Optional and predictable brackets for counting-process martingales)
Finite total variation bounds every partition sum of absolute increments. (Bounded variation and total variation on an interval)
Every closed finite interval is compact. (Heine-Borel by bisection: every closed bounded interval is compact)
A continuous real function on a compact subset of is uniformly continuous. (Heine-Cantor in : a continuous real function on a compact subset of is uniformly continuous)
Finite Cauchy–Schwarz bounds the absolute inner product of two finite real lists by the product of their Euclidean norms. (The Cauchy-Schwarz inequality for finite sums)
Proof
For finitely many distinct jump times , choose disjoint intervals with . A partition containing all their endpoints has variation at least , so [F2] and the left limits give . Hence each set of jumps of size at least is finite, in its canonical time order, and the nonzero jumps form a countable set with . Let . Absolute convergence makes omitted jump tails uniformly small, so finite jump partial sums converge uniformly to a path ; right continuity passes by an estimate, and their left limits are Cauchy under the uniform tail bound, so completeness of gives left limits for . Absolute convergence gives . For any partition, each increment of is a subseries of its jumps, so ; the same argument bounds the variation of any omitted jump tail by its absolute sum. Therefore is continuous and of finite variation. Choose a finite retained jump sum with omitted tail satisfying , and set . By [F3] and [F4], the continuous part has squared-increment sum at most , where ; sufficiently fine partitions separate the finitely many retained jump times, so tends to the sum of their squared jumps, with cross terms between each retained jump and the continuous increment in its partition cell tending to zero by the same modulus.
For every partition, expansion of squares and [F5] give , since . Also gives ; applying the same finite-list expansion and [F5] to the jump sums, then using their absolute convergence [F1], yields . Since the squared-increment sums for converge to by step 1.1, these two error bounds show that the limsup distance between the squared-increment sums for and is at most . Letting proves .
For every finite partition, telescoping differences of squares gives . Step 2.1 gives the limit of the second sum, and rearrangement gives the stated limit of the left-endpoint sums.
Source notes
Bass gives the jump-square convention in §2.4 and derives the semimartingale product formula from Itô’s formula in §2.6. The finite-variation partition argument here is supplied locally. Tian states the compensated-counting-process bracket formula while explicitly referring its proof elsewhere. The local argument above supplies the pathwise finite-variation limit used here.
Brackets of a compensated simple counting process
Statement
Under the finite-horizon contract of Simple counting-process intensity and compensator contract, the optional quadratic variation of is , its continuous predictable bracket is , its self-cross predictable bracket is , and is a martingale on .
Facts & Assumptions
Given: A simple unit-jump counting process , a continuous predictable increasing compensator with and , and the model contract that is a square-integrable martingale.
The finite-horizon objects, unit jumps, integrability and martingale contract are exactly those of the counting-process model. (Simple counting-process intensity and compensator contract)
Optional brackets are jump-square sums. A scalar predictable bracket candidate is a continuous predictable increasing process with , , and a martingale; a cross-bracket candidate is continuous predictable of finite variation, starts at zero, has integrable total variation, and makes a martingale. (Optional and predictable brackets for counting-process martingales) Candidates are unique up to indistinguishability in these classes by Uniqueness of continuous predictable brackets.
A bounded predictable step integral against a square-integrable martingale is a square-integrable martingale. (Elementary predictable counting-process integrals are martingales)
For a finite-variation càdlàg path, squared partition increments converge to its jump-square sum, and the finite-partition square identity holds. (Finite-variation integration by parts for counting-process martingales)
Bounded stopping preserves a càdlàg square-integrable martingale. (Bounded stopping preserves càdlàg square-integrable martingales)
The sampled discrete-time martingale satisfies Doob's maximal inequality. (Doob Lp maximal inequality)
Dominated convergence passes limits through event integrals. (Dominated convergence)
Increasing nonnegative integrals converge to the integral of the limit. (Monotone convergence for the integral)
AC is inherited through conditional expectation and the sampled Doob inequality. (The Axiom of Choice)
Proof
Since is continuous, ; each jump of is zero or one, so the jump-square definition gives , using .
Let and for integers . The adapted nondecreasing càdlàg process satisfies for , so is bounded stopping; at the first crossing, continuity of and unit jumps of give , hence . By [F5], is a square-integrable martingale.
The variables and are integrable, so is integrable; since is a martingale starting at zero, . The pathwise total variation of is at most , hence is integrable.
Choose nested deterministic partitions with mesh tending to zero. The coefficients are -measurable and bounded by , so [F3] makes the step integral against a martingale. The partition identity [F4] gives . The stopped process has the same unit jumps as , so the squared-increment sum converges to by [F4] and step 1.1. Also , so the terms are bounded by a deterministic constant depending only on ; dominated convergence in the martingale event identities proves is a martingale.
Since a.s., eventually on each path. On nested deterministic grids, [F6] gives ; right continuity identifies the increasing grid limit with , and [F8] gives . Thus is integrable and dominates every stopped value . For , [F7] and the event identities from step 2.2 let , proving is a martingale.
Since is a martingale, is a martingale by step 3.1 and linearity, so [F2] and [F1] make a scalar bracket candidate; uniqueness gives . Also , so is a martingale, making a cross-bracket candidate too; uniqueness gives .
Source notes
Tian states and for a continuous compensator, but omits the bracket proof. Bass supplies the jump-square and product-formula framework; Andersen–Borgan–Gill–Keiding define the counting-process compensator under an explicit filtration. The stopped-grid and finite-variation arguments above complete the local proof without assuming a general compensator-existence theorem.
Cross brackets vanish without simultaneous jumps
Statement
Let be simple unit-jump counting processes on one common filtration, each satisfying the finite-horizon contract of Simple counting-process intensity and compensator contract with continuous compensator and martingale . If almost surely no two distinct processes jump at the same time, then for , No independence assumption is required.
Facts & Assumptions
Given: Finitely many unit-jump counting processes on a common filtration, continuous compensators, the square-integrable martingale contracts, and pairwise absence of simultaneous jumps almost surely.
Each is continuous and each is a martingale. (Simple counting-process intensity and compensator contract)
Optional cross brackets are jump-product sums, and predictable cross brackets are continuous predictable finite-variation compensators. (Optional and predictable brackets for counting-process martingales)
Continuous predictable brackets in this class are unique. (Uniqueness of continuous predictable brackets)
AC is inherited through the martingale and conditional-expectation interface. (The Axiom of Choice)
Proof
For every , continuity of each gives . The no-simultaneous-jump hypothesis therefore gives for every and every , outside one probability-zero event. By the optional cross-variation definition in [F2], for all .
The zero process is continuous, predictable, has finite variation, and satisfies , which is a martingale. Thus it is a continuous predictable cross-bracket candidate. Uniqueness [F3] implies . The proof uses the common filtration for the component martingale contracts and uses no independence.
Source notes
Tian states zero cross brackets under a no-simultaneous-jump hypothesis; Andersen–Borgan–Gill–Keiding impose the same condition for multivariate counting processes. The argument here proves both zero bracket identities directly from the jump-sum and predictable-compensator definitions.
Isometry for elementary predictable counting-process integrals
Statement
Under the finite-horizon contract, for every bounded predictable step integrand , the elementary process is a square-integrable martingale and The terminal class is independent of the chosen finite-step representation of the same integrand in the compensator seminorm.
Facts & Assumptions
Given: A simple counting-process contract , the martingale , and a bounded predictable step integrand on a finite deterministic partition.
is square-integrable, and is an integrable martingale on the finite horizon. (Simple counting-process intensity and compensator contract Brackets of a compensated simple counting process)
The elementary integral is the finite sum of coefficients times martingale increments. (Elementary predictable integral against a counting-process martingale)
If is integrable, a bounded -measurable factor can be taken out of conditional expectation given . The same holds for a finite real such when is integrable; then is integrable too. (Taking out what is known)
The elementary integral process is a square-integrable martingale. (Elementary predictable counting-process integrals are martingales)
Products of two random variables are integrable by Cauchy–Schwarz. (Cauchy-Schwarz for random variables)
AC is inherited through the conditional-expectation interface. (The Axiom of Choice)
Proof
On each , write and . The martingale gives ; expand the left square as . Since and are in , their product is integrable by [F5], so [F3] applies with the possibly unbounded factor . Use to get . By [F3], .
If , then is -measurable and its product with is integrable by boundedness of and [F5]; [F3] and give . Expanding the finite-sum square [F2], all off-diagonal terms vanish, and step 1.1 gives ; the martingale assertion is [F4].
If two step representations agree in the compensator seminorm, their difference has seminorm zero; applying the isometry in step 2.1 to the refined difference representation makes the squared norm of their terminal-integral difference zero, so they define the same terminal class.
Source notes
Tian’s Unit 9, PDF p. 12, states the scalar bracket result. Unit 10, Theorems 12.3–12.4, PDF pp. 5 and 12, states the bounded predictable-integral martingale and integral-bracket results, referring full proofs to Fleming–Harrington; Theorem 12.4 additionally assumes bounded . The local finite-step proof here uses the stated square-integrable model contract without that extra boundedness assumption. Bass describes the same completion route for jump martingales. The conditional-variance and orthogonal-increment calculation above supplies the finite-step proof.
L² extension of the predictable counting-process integral
Statement
For every predictable on with , the limit in L² counting-process integral when the limit exists exists at each , is independent of the approximating step sequence, and defines a square-integrable martingale. It satisfies, for each ,
Facts & Assumptions
Given: The finite-horizon counting-process contract, a predictable real , and finite energy .
Bounded predictable step integrals are martingales and satisfy the elementary isometry. (Isometry for elementary predictable counting-process integrals)
Bounded predictable step processes are dense in the compensator norm. (Predictable step processes are dense for the compensator L² norm)
is complete for each measure space, including ; thus an -Cauchy sequence of -measurable classes has an -measurable limit. (Riesz-Fischer completeness of for )
Conditional expectation is an contraction. (Conditional lp contraction)
The integral notation denotes the limits of elementary integrals when those limits exist. (L² counting-process integral when the limit exists)
AC is inherited from the conditional-expectation and interfaces. (The Axiom of Choice)
Proof
By [F2], choose bounded predictable step processes with . For any , [F1] gives , so terminal integrals are Cauchy in ; the same estimate on gives the Cauchy property at every . [F3] gives a unique full-space limit and, since every is -measurable, also an -measurable limit at each fixed ; uniqueness makes these the same class.
If is another step sequence converging to , then . Applying [F1] to makes the terminal limits and each fixed-time limit equal in , so the limits in [F5] are independent of approximation.
Norm continuity and [F1] give, for every , . This proves square integrability and the isometry.
For , [F1] gives . By [F4], conditional expectations converge in to , while in by step 1.1; uniqueness of limits yields . Hence the extension is a square-integrable martingale, with no claim for predictable integrands of infinite compensator energy.
Source notes
Bass describes the completion for predictable jump-martingale integrands; Tian states the counting-process martingale and bracket results. The local density lemma and elementary isometry above provide the full completion proof for the finite-energy domain used here.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Richard F. Bass, SDEs with Jumps, Section 2.3, PDF pp. 3–4
- Lu Tian, STAT331 Unit 8: Lebesgue-Stieltjes Integrals, Martingales, Counting Processes, PDF pp. 1–5, 12–14
- P. K. Andersen, Ø. Borgan, R. D. Gill, N. Keiding, Censoring, Truncation and Filtering in Statistical Models Based on Counting Processes, §2, PDF pp. 3–8
- Lu Tian, STAT331 Unit 9: Some Key Results for Counting Process Martingales, PDF pp. 10–12
- Richard F. Bass, SDEs with Jumps, Section 2.4, PDF pp. 4–6
- Lu Tian, STAT331 Unit 10: Combining Martingales, Stochastic Integrals, and Applications, PDF pp. 4–5
- Richard F. Bass, SDEs with Jumps, Section 2.5, PDF p. 5
- Lu Tian, STAT331 Unit 9: Some Key Results for Counting Process Martingales, PDF pp. 9–12
- Lu Tian, STAT331 Unit 10: Combining Martingales, Stochastic Integrals, and Applications, PDF p. 5
- Richard F. Bass, SDEs with Jumps, Sections 2.4 and 2.6, PDF pp. 5–7
- Lu Tian, STAT331 Unit 9: Some Key Results for Counting Process Martingales, PDF p. 12
- Richard F. Bass, SDEs with Jumps, Sections 2.4–2.6, PDF pp. 5–7
- Lu Tian, STAT331 Unit 10: Combining Martingales, Stochastic Integrals, and Applications, PDF p. 4
- P. K. Andersen, Ø. Borgan, R. D. Gill, N. Keiding, Censoring, Truncation and Filtering in Statistical Models Based on Counting Processes, §2, PDF pp. 3–4
- Lu Tian, STAT331 Unit 10: Combining Martingales, Stochastic Integrals, and Applications, Theorems 12.3–12.4, PDF pp. 5 and 12