Alphabeta Math
Pipeline-generated
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.

✓ 10 results · all verified · 5 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 5 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Counting-process compensators, integrals, brackets

1 · Prerequisites

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 At=∫0tYsλs ds. The contract explicitly assumes M=N−A 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 [M]=N, ⟨M⟩=A, and M2−A 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 H with E∫0TH2 dA<∞. 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

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

A continuous finite-variation martingale is constant

Statement

Let D=(Dt)0≤t≤T be a continuous martingale relative to a filtration (Ft), with D0=0. Suppose each path has finite total variation VT(D) and EVT(D)<∞. Then D is indistinguishably zero on [0,T].

Facts & Assumptions

Given: A finite horizon T, a filtered probability space, and a continuous adapted martingale D with D0=0 and integrable pathwise total variation.

[F1]

The all-pairs martingale identity holds at every s≤t, and the continuous-path hypothesis supplies a measurable probability-one event on which each path of D is continuous. (Continuous-time adapted processes and martingales)

[F2]

A bounded Fs-measurable factor can be taken outside conditional expectation given Fs. (Taking out what is known)

[F3]

Dominated convergence passes limits through integrals under an integrable majorant. (Dominated convergence)

[F4]

Total variation bounds every partition sum of absolute increments. (Bounded variation and total variation on an interval)

[F5]

Every finite closed interval [0,T] is compact. (Heine-Borel by bisection: every closed bounded interval [a,b] is compact)

[F6]

A continuous real function on a compact subset of R is uniformly continuous. (Heine-Cantor in R: a continuous real function on a compact subset of R is uniformly continuous)

[F7]

A nonnegative random variable with expectation zero vanishes almost surely. (A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere)

[F8]

Indistinguishability means equality for every time outside one measurable probability-one event. (Process law, modification, and indistinguishability)

[A1]

AC is inherited from the conditional-expectation interface used by the continuous-time martingale definition. (The Axiom of Choice)

Proof

1.1constructalgebra

Fix R>0 and define ϕR(x)=max⁡(−R,min⁡(x,R)) and GR(x)={x2/2,∣x∣≤R,R∣x∣−R2/2,∣x∣≥R. The explicit piecewise formula gives GR′=ϕR; ϕR is bounded by R and is 1-Lipschitz, while GR≥0 and GR(x)=0 exactly when x=0. Splitting an interval at −R and R if needed and using the Lipschitz bound gives, for all x,y∈R, ∣GR(y)−GR(x)−ϕR(x)(y−x)∣≤12∣y−x∣2.

2.1A1F1F2F3F4F5F6F7givenconstruct

Fix t∈(0,T] and deterministic partitions 0=t0m<⋯<tqmm=t with mesh tending to zero. Put Sm=∑j=0qm−1ϕR(Dtjm)(Dtj+1m−Dtjm). Each coefficient is bounded and Ftjm-measurable. The martingale identity and [F2] give ESm=0. The estimate of step 1.1 and the total-variation bound [F4] imply ∣Sm−GR(Dt)+GR(D0)∣≤12∑j∣Dtj+1m−Dtjm∣2≤12max⁡j∣Dtj+1m−Dtjm∣ VT(D). On the probability-one continuity event in [F1], compactness [F5] and Heine--Cantor [F6] make the maximum increment tend to zero. Thus Sm→GR(Dt) almost surely, since D0=0. Also ∣Sm∣≤RVT(D), an integrable bound by the hypothesis. Dominated convergence [F3] yields EGR(Dt)=0. Since GR is nonnegative and vanishes only at zero, [F7] gives Dt=0 almost surely.

3.1F1F8step 2.1givenconstruct∎

The conclusion also holds at t=0 because D0=0. For every rational r∈[0,T], step 2.1 gives a measurable probability-one event on which Dr=0. 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 Dt=0 for every t∈[0,T]. By [F8], D 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.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

Bounded stopping preserves càdlàg square-integrable martingales

Statement

Let M=(Mt)0≤t≤T be a square-integrable all-pairs martingale with right-continuous paths with left limits for every ω, and let τ≤T be a stopping time. Then the stopped process Mtτ:=Mt∧τ is a square-integrable martingale on [0,T].

Facts & Assumptions

Given: A finite horizon, a square-integrable all-pairs martingale with pathwise càdlàg paths, and a bounded stopping time τ.

[F1]

On [0,T], use the adaptedness, all-pairs conditional-expectation identity and pointwise L2 conditions of Continuous-time adapted processes and martingales with times restricted to this interval. This agrees with its [0,∞) convention: extend M and the filtration by M~t=Mt∧T and F~t=Ft∧T. For s≤T<t the extended martingale identity is E[MT∣Fs]=Ms; for T≤s≤t it is the known-variable identity, and for s≤t≤T it is the given identity. Thus this extension is a square-integrable martingale, without any filtration augmentation.

[F2]

A map τ is a stopping time when {τ≤t}∈Ft. (Continuous-time stopping times and stopped sigma-algebras)

[F3]

The absolute value of a martingale is a nonnegative submartingale, and the finite discrete-time Doob L2 inequality bounds its grid maximum by twice the terminal L2 norm. (Absolute value and powers of a martingale are submartingales Doob Lp maximal inequality)

[F4]

Dominated convergence passes limits through event integrals. (Dominated convergence)

[F5]

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

[A1]

AC is inherited through the conditional-expectation interface in [F1]. (The Axiom of Choice)

Proof

1.1A1F1F3F5given

Let πn be nested finite partitions of [0,T] containing any fixed s,t with mesh tending to zero. For each πn, the values of ∣M∣ on its grid form a discrete-time nonnegative submartingale by [F1, F3]. The Doob bound gives Emax⁡u∈πn∣Mu∣2≤4E∣MT∣2. Càdlàg paths and the nested dense grids imply sup⁡u≤T∣Mu∣=sup⁡u∈∪nπn∣Mu∣; [F5] then gives Esup⁡u≤T∣Mu∣2<∞.

1.2A1F1F2givenalgebra

For a finite partition πn={r0<⋯<rm}, round τ up to the first grid point τn≥τ. This is a finite-valued stopping time because {τn≤rj}={τ≤rj}∈Frj. At adjacent grid points, Mrk∧τn−Mrk−1∧τn=1{τn>rk−1}(Mrk−Mrk−1); the indicator is Frk−1-measurable. Conditioning each increment on its left endpoint proves the stopped grid values have the martingale identity at grid times, in particular at s,t.

2.1A1F1F4step 1.1step 1.2∎

Refine the partitions while keeping s,t as grid points. Then τn↓τ, and pathwise right continuity gives Ms∧τn→Ms∧τ and Mt∧τn→Mt∧τ. For u=s or u=t, the events {τn=rj} with grid value rj<u lie in Frj⊆Fu, and their complement {τn≥u} is also in Fu; expressing Mu∧τn over these finitely many events proves Fu-measurability. The pointwise limits are then measurable there without completing the filtration. Both are dominated by sup⁡u≤T∣Mu∣, integrable by step 1.1. For each B∈Fs, apply [F4] to the event-integral martingale identity from step 1.2; it yields E[1B(Mt∧τ−Ms∧τ)]=0, hence the stopped process satisfies the all-pairs martingale identity. Also ∣Mt∧τ∣≤sup⁡u≤T∣Mu∣ 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.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Simple counting-process intensity and compensator contract

Definition

Assume the Axiom of Choice The Axiom of Choice. Fix a finite horizon T>0, a probability space (Ω,F,P) and a continuous-time filtration (Ft)0≤t≤T 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 N with N0=0, NT<∞ almost surely, and ΔNt∈{0,1} for every 0<t≤T outside one null event; here ΔNt:=Nt−Nt−.

An at-risk process is a predictable process Y:[0,T]×Ω→{0,1}, and an intensity density is a finite, nonnegative predictable process λ. Form the Lebesgue integral At:=∫0tYsλs ds,0≤t≤T. For this model and every nonnegative predictable process G, define the pathwise energy integral by ∫0tGs dAs:=∫0tGsYsλs ds,t≤T. The continuous intensity compensator contract requires the defining integral for A to be finite pathwise, and requires A to be continuous, adapted and predictable with A0=0, and that E[AT]<∞. Set Mt:=Nt−At. The model contract is the additional hypothesis that M is a square-integrable martingale relative to the stated filtration. Under this contract A is a continuous predictable compensator of N.

The displayed intensity density alone does not assert that N−A is a martingale, that such a process exists for a given N, 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 N−A is a local martingale. This library contract strengthens that model clause to a square-integrable martingale and imposes E[AT]<∞ for the isometry developed below. It makes no existence claim from an intensity formula.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Optional and predictable brackets for counting-process martingales

Definition

Work on the finite horizon [0,T] of Simple counting-process intensity and compensator contract. For càdlàg (right-continuous with left limits) finite-variation processes X,Y starting at zero, with ΔXs:=Xs−Xs− and ΔYs:=Ys−Ys−, define their optional quadratic covariation by [X,Y]t:=∑0<s≤tΔXs ΔYs, and write [X]:=[X,X]. 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 M=N−A from Simple counting-process intensity and compensator contract, a continuous predictable bracket ⟨M⟩ is a continuous, predictable, increasing process B with B0=0, E[BT]<∞, and M2−B a martingale, when such a process exists. For two square-integrable model martingales M=N−A and M′=N′−A′ from that contract, a continuous predictable cross bracket ⟨M,M′⟩ is a continuous, predictable finite-variation process C with C0=0, EVar⁡(C)T<∞, and [M,M′]−C 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.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Elementary predictable integral against a counting-process martingale

Definition

Let M be a square-integrable martingale on a finite horizon [0,T] 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 0=t0<t1<⋯<tm=T be a deterministic partition, and let each bounded random variable Hj be Ftj-measurable. The associated bounded predictable step integrand is H0=0 at time 0 and Hs=Hj on (tj,tj+1]. For this chosen step representation define, for 0≤t≤T, It(H):=∑j=0m−1Hj(Mt∧tj+1−Mt∧tj). 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.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

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.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

L² counting-process integral when the limit exists

Definition

For the compensator contract on [0,T], let H be a predictable real process with E∫0THs2 dAs<∞. When the elementary integrals of a sequence of bounded predictable step processes converging to H in this norm converge in L2(P), denote the resulting L2(P) class at time t by ∫0tHs dMs. The definition is conditional on existence of the limit. The L²-extension theorem below proves existence for every such predictable H, independence from the approximating sequence, the martingale property, and the isometry. The Axiom of Choice is inherited through the conditional-expectation and L2-completion interfaces used by that theorem.

Source notes

Bass describes the construction of the jump-martingale stochastic integral as the L2 completion of elementary predictable integrals. This local definition states the domain through the actual compensator A and leaves the existence claim to the following theorem.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Uniqueness of continuous predictable brackets

Statement

Let X be an adapted process on [0,T]. Suppose C,D are continuous, predictable finite-variation processes with C0=D0=0, E[Var⁡(C)T+Var⁡(D)T]<∞, and both X−C and X−D are martingales. Then C and D 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.

[F1]

A continuous finite-variation martingale with integrable total variation and initial value zero is indistinguishably zero. (A continuous finite-variation martingale is constant)

[F2]

A martingale is an adapted integrable process satisfying the all-pairs conditional-expectation identity. (Continuous-time adapted processes and martingales)

[F3]

Conditional expectation is linear, so differences of martingales are martingales. (Basic algebra and order properties of conditional expectation)

[F4]

Indistinguishability means equality for all times outside one probability-one event. (Process law, modification, and indistinguishability)

[A1]

AC is inherited from the conditional-expectation interface in [F2]. (The Axiom of Choice)

Proof

1.1A1F1F2F3given

The difference D−C=(X−C)−(X−D) is a martingale by [F3]. It is continuous, has finite variation, starts at zero, and EVar⁡(D−C)T≤EVar⁡(D)T+EVar⁡(C)T<∞, so it satisfies [F1].

2.1F1F4step 1.1∎

By [F1], D−C is zero outside one probability-one event, which is indistinguishability by [F4]. Hence C=D 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.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Elementary predictable counting-process integrals are martingales

Statement

Let M be any square-integrable martingale on [0,T], and let H be a bounded predictable step integrand on a deterministic partition. The elementary integral (It(H))0≤t≤T of Elementary predictable integral against a counting-process martingale is a square-integrable martingale.

Facts & Assumptions

Given: A finite-horizon square-integrable martingale M=N−A and a bounded step integrand Hj∈Ftj on a deterministic partition.

[F1]

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)

[F2]

The elementary integral is the finite sum of the step coefficients times the corresponding increments of M. (Elementary predictable integral against a counting-process martingale)

[F3]

A bounded measurable factor known at time u can be taken out of conditional expectation given Fu. (Taking out what is known)

[A1]

AC is inherited through the continuous-time conditional-expectation definition. (The Axiom of Choice)

Proof

1.1F1F2givenalgebra

Each summand in [F2] is Ft-measurable at its current endpoint. It is square-integrable because Hj is bounded and each martingale increment is in L2. A finite sum is therefore adapted and square-integrable at every t≤T.

2.1A1F1F3step 1.1given∎

Fix 0≤s≤t≤T and B∈Fs. Refine the original deterministic partition by inserting s and t. After subtracting Is(H) from It(H), each remaining piece has the form Hj(Mv−Mu) on an interval (u,v] with u≥s and tj≤u. Thus 1BHj is bounded and Fu-measurable. Since E[Mv−Mu∣Fu]=0, [F3] gives E[1BHj(Mv−Mu)]=0. Summing the finitely many pieces yields E[1B(It(H)−Is(H))]=0. The event-integral characterization of conditional expectation proves E[It(H)∣Fs]=Is(H). 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.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Finite-variation integration by parts for counting-process martingales

Statement

Let x:[0,T]→R be càdlàg (right-continuous with left limits) and of finite total variation. For any deterministic partitions πn of [0,T] with mesh tending to zero, and each fixed t≤T, put Δjnx(t)=xt∧tj+1n−xt∧tjn. Then ∑j(Δjnx(t))2⟶[x]t:=∑0<s≤t(Δxs)2, and the left-endpoint sums satisfy ∑jxt∧tjn Δjnx(t)⟶xt2−x02−[x]t2.

Facts & Assumptions

Given: A càdlàg real path of finite variation on [0,T], the jump-sum convention for [x], and deterministic partitions whose mesh tends to zero.

[F1]

For finite-variation càdlàg paths, [x]t is the absolutely convergent jump-square sum. (Optional and predictable brackets for counting-process martingales)

[F2]

Finite total variation bounds every partition sum of absolute increments. (Bounded variation and total variation on an interval)

[F3]

Every closed finite interval [0,T] is compact. (Heine-Borel by bisection: every closed bounded interval [a,b] is compact)

[F4]

A continuous real function on a compact subset of R is uniformly continuous. (Heine-Cantor in R: a continuous real function on a compact subset of R is uniformly continuous)

[F5]

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

1.1F1F2F3F4givenconstruct

For finitely many distinct jump times 0<s1<⋯<sq≤T, choose disjoint intervals (ui,si] with ui↑si. A partition containing all their endpoints has variation at least ∑i∣xsi−xui∣, so [F2] and the left limits give ∑i∣Δxsi∣≤Var⁡[0,T](x). Hence each set of jumps of size at least 1/m is finite, in its canonical time order, and the nonzero jumps form a countable set with ∑0<s≤T∣Δxs∣≤Var⁡[0,T](x). Let Jt=∑0<s≤tΔxs. Absolute convergence makes omitted jump tails uniformly small, so finite jump partial sums converge uniformly to a path J; right continuity passes by an ε/3 estimate, and their left limits are Cauchy under the uniform tail bound, so completeness of R gives left limits for J. Absolute convergence gives ΔJs=Δxs. For any partition, each increment of J is a subseries of its jumps, so Var⁡[0,T](J)≤∑0<s≤T∣Δxs∣; the same argument bounds the variation of any omitted jump tail by its absolute sum. Therefore xc:=x−J is continuous and of finite variation. Choose a finite retained jump sum z with omitted tail r:=J−z satisfying Var⁡[0,T](r)<ε, and set y=x−r=xc+z. By [F3] and [F4], the continuous part has squared-increment sum at most ωxc(∥πn∥)Var⁡[0,T](xc)→0, where ωxc(δ):=sup⁡∣u−v∣≤δ∣xuc−xvc∣; sufficiently fine partitions separate the finitely many retained jump times, so ∑j(Δjny(t))2 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.

2.1F1F2F5step 1.1given

For every partition, expansion of squares and [F5] give ∣∑j(Δjnx(t))2−∑j(Δjny(t))2∣≤2Var⁡[0,T](y)Var⁡[0,T](r)+Var⁡[0,T](r)2≤2Var⁡[0,T](x)ε+3ε2, since Var⁡[0,T](y)≤Var⁡[0,T](x)+ε. Also x=y+r gives Δxs=Δys+Δrs; applying the same finite-list expansion and [F5] to the jump sums, then using their absolute convergence [F1], yields ∣[x]t−[y]t∣≤2Var⁡[0,T](y)Var⁡[0,T](r)+Var⁡[0,T](r)2≤2Var⁡[0,T](x)ε+3ε2. Since the squared-increment sums for y converge to [y]t by step 1.1, these two error bounds show that the limsup distance between the squared-increment sums for x and [x]t is at most 4Var⁡[0,T](x)ε+6ε2. Letting ε→0 proves ∑j(Δjnx(t))2→∑0<s≤t(Δxs)2.

3.1step 2.1algebra∎

For every finite partition, telescoping differences of squares gives xt2−x02=2∑jxt∧tjnΔjnx(t)+∑j(Δjnx(t))2. 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.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

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 M=N−A is [M]t=Nt, its continuous predictable bracket is ⟨M⟩t=At, its self-cross predictable bracket is ⟨M,M⟩t=At, and Mt2−At is a martingale on [0,T].

Facts & Assumptions

Given: A simple unit-jump counting process N, a continuous predictable increasing compensator A with A0=0 and EAT<∞, and the model contract that M=N−A is a square-integrable martingale.

[F1]

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)

[F2]

Optional brackets are jump-square sums. A scalar predictable bracket candidate is a continuous predictable increasing process B with B0=0, EBT<∞, and M2−B a martingale; a cross-bracket candidate is continuous predictable of finite variation, starts at zero, has integrable total variation, and makes [M,M′]−B 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.

[F3]

A bounded predictable step integral against a square-integrable martingale is a square-integrable martingale. (Elementary predictable counting-process integrals are martingales)

[F4]

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)

[F5]

Bounded stopping preserves a càdlàg square-integrable martingale. (Bounded stopping preserves càdlàg square-integrable martingales)

[F6]

The sampled discrete-time martingale satisfies Doob's L2 maximal inequality. (Doob Lp maximal inequality)

[F7]

Dominated convergence passes limits through event integrals. (Dominated convergence)

[F8]

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

[A1]

AC is inherited through conditional expectation and the sampled Doob inequality. (The Axiom of Choice)

Proof

1.1F1F2

Since A is continuous, ΔMs=ΔNs; each jump of N is zero or one, so the jump-square definition gives [M]t=∑0<s≤t(ΔNs)2=Nt, using N0=0.

1.2F1F5givenconstruct

Let S=N+A and τn=inf⁡{t:St≥n}∧T for integers n≥1. The adapted nondecreasing càdlàg process S satisfies {τn≤t}={St≥n} for t<T, so τn is bounded stopping; at the first crossing, continuity of A and unit jumps of N give Sτn≤n+1, hence ∣Mt∧τn∣≤n+1. By [F5], Mτn is a square-integrable martingale.

2.1A1F1step 1.1

The variables MT and AT are integrable, so NT=MT+AT is integrable; since M is a martingale starting at zero, ENT=EAT<∞. The pathwise total variation of M is at most NT+AT, hence is integrable.

2.2A1F1F3F4step 1.1given

Choose nested deterministic partitions πm={0=t0m<⋯<tqmm=T} with mesh tending to zero. The coefficients Hjn,m=Mtjm∧τn are Ftjm-measurable and bounded by n+1, so [F3] makes the step integral against Mτn a martingale. The partition identity [F4] gives (Mt∧τn)2−∑j(Mt∧tj+1m∧τn−Mt∧tjm∧τn)2=2It(Hn,m). The stopped process has the same unit jumps as Nτn, so the squared-increment sum converges to [Mτn]t=Nt∧τn by [F4] and step 1.1. Also Var⁡(Mτn)T≤NT∧τn+AT∧τn≤n+1, so the terms are bounded by a deterministic constant depending only on n; dominated convergence in the martingale event identities proves (Mt∧τn)2−Nt∧τn is a martingale.

3.1A1F1F6F7F8step 2.1step 2.2

Since ST=NT+AT<∞ a.s., τn=T eventually on each path. On nested deterministic grids, [F6] gives Emax⁡u∈πm∣Mu∣2≤4E∣MT∣2; right continuity identifies the increasing grid limit with sup⁡u≤T∣Mu∣, and [F8] gives Esup⁡u≤T∣Mu∣2<∞. Thus R=sup⁡u≤T∣Mu∣2+NT is integrable and dominates every stopped value ∣(Mt∧τn)2−Nt∧τn∣. For B∈Fs, [F7] and the event identities from step 2.2 let n→∞, proving M2−N is a martingale.

4.1A1F1F2step 1.1step 3.1algebra∎

Since N−A=M is a martingale, M2−A=(M2−N)+M is a martingale by step 3.1 and linearity, so [F2] and [F1] make A a scalar bracket candidate; uniqueness gives ⟨M⟩=A. Also [M,M]=[M]=N, so [M,M]−A=N−A=M is a martingale, making A a cross-bracket candidate too; uniqueness gives ⟨M,M⟩=A.

Source notes

Tian states [M]=N and ⟨M⟩=A 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.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Cross brackets vanish without simultaneous jumps

Statement

Let N1,…,Nk 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 Ai and martingale Mi=Ni−Ai. If almost surely no two distinct processes jump at the same time, then for i≠j, [Mi,Mj]t=0and⟨Mi,Mj⟩t=0(0≤t≤T). 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.

[F1]

Each Ai is continuous and each Mi=Ni−Ai is a martingale. (Simple counting-process intensity and compensator contract)

[F2]

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)

[F3]

Continuous predictable brackets in this class are unique. (Uniqueness of continuous predictable brackets)

[A1]

AC is inherited through the martingale and conditional-expectation interface. (The Axiom of Choice)

Proof

1.1F1F2given

For every s, continuity of each Ai gives ΔMsi=ΔNsi. The no-simultaneous-jump hypothesis therefore gives ΔMsiΔMsj=0 for every s and every i≠j, outside one probability-zero event. By the optional cross-variation definition in [F2], [Mi,Mj]t=∑s≤tΔMsiΔMsj=0 for all t≤T.

2.1A1F2F3step 1.1∎

The zero process is continuous, predictable, has finite variation, and satisfies [Mi,Mj]−0=0, which is a martingale. Thus it is a continuous predictable cross-bracket candidate. Uniqueness [F3] implies ⟨Mi,Mj⟩=0. 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.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

Isometry for elementary predictable counting-process integrals

Statement

Under the finite-horizon contract, for every bounded predictable step integrand H, the elementary process It(H)=∫0tHs dMs is a square-integrable martingale and E[IT(H)2]=E∫0THs2 dAs. The terminal L2 class is independent of the chosen finite-step representation of the same integrand in the compensator L2 seminorm.

Facts & Assumptions

Given: A simple counting-process contract M=N−A, the martingale M2−A, and a bounded predictable step integrand Hj∈Ftj on a finite deterministic partition.

[F1]

M is square-integrable, and M2−A is an integrable martingale on the finite horizon. (Simple counting-process intensity and compensator contract Brackets of a compensated simple counting process)

[F2]

The elementary integral is the finite sum of coefficients times martingale increments. (Elementary predictable integral against a counting-process martingale)

[F3]

If X is integrable, a bounded Ftj-measurable factor Z can be taken out of conditional expectation given Ftj. The same holds for a finite real such Z when ZX is integrable; then ZE[X∣Ftj] is integrable too. (Taking out what is known)

[F4]

The elementary integral process is a square-integrable martingale. (Elementary predictable counting-process integrals are martingales)

[F5]

Products of two L2 random variables are integrable by Cauchy–Schwarz. (Cauchy-Schwarz for random variables)

[A1]

AC is inherited through the conditional-expectation interface. (The Axiom of Choice)

Proof

1.1A1F1F3F5givenalgebra

On each (tj,tj+1], write ΔMj=Mtj+1−Mtj and ΔAj=Atj+1−Atj. The martingale M2−A gives E[Mtj+12−Mtj2∣Ftj]=E[ΔAj∣Ftj]; expand the left square as (ΔMj)2+2MtjΔMj. Since Mtj and ΔMj are in L2, their product is integrable by [F5], so [F3] applies with the possibly unbounded factor Mtj. Use E[ΔMj∣Ftj]=0 to get E[(ΔMj)2∣Ftj]=E[ΔAj∣Ftj]. By [F3], E[Hj2(ΔMj)2]=E[Hj2ΔAj].

2.1F1F2F3F4F5step 1.1algebra

If i<j, then HiΔMiHj is Ftj-measurable and its product with ΔMj is integrable by boundedness of H and [F5]; [F3] and E[ΔMj∣Ftj]=0 give E[HiΔMiHjΔMj]=0. Expanding the finite-sum square [F2], all off-diagonal terms vanish, and step 1.1 gives E[IT(H)2]=∑jE[Hj2(ΔMj)2]=∑jE[Hj2ΔAj]=E∫0THs2 dAs; the martingale assertion is [F4].

3.1step 2.1algebra∎

If two step representations agree in the compensator L2 seminorm, their difference has seminorm zero; applying the isometry in step 2.1 to the refined difference representation makes the squared L2 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 N. The local finite-step proof here uses the stated square-integrable model contract without that extra boundedness assumption. Bass describes the same L2 completion route for jump martingales. The conditional-variance and orthogonal-increment calculation above supplies the finite-step proof.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

L² extension of the predictable counting-process integral

Statement

For every predictable H on [0,T] with E∫0THs2 dAs<∞, the limit in L² counting-process integral when the limit exists exists at each t≤T, is independent of the approximating step sequence, and defines a square-integrable martingale. It satisfies, for each t≤T, E(∫0tHs dMs)2=E∫0tHs2 dAs.

Facts & Assumptions

Given: The finite-horizon counting-process contract, a predictable real H, and finite energy E∫0THs2dAs<∞.

[F1]

Bounded predictable step integrals are martingales and satisfy the elementary isometry. (Isometry for elementary predictable counting-process integrals)

[F2]

Bounded predictable step processes are dense in the compensator L2 norm. (Predictable step processes are dense for the compensator L² norm)

[F3]

L2 is complete for each measure space, including (Ω,Ft,P∣Ft); thus an L2-Cauchy sequence of Ft-measurable classes has an Ft-measurable limit. (Riesz-Fischer completeness of Lp for 1≤p≤∞)

[F4]

Conditional expectation is an L2 contraction. (Conditional lp contraction)

[F5]

The integral notation denotes the L2 limits of elementary integrals when those limits exist. (L² counting-process integral when the limit exists)

[A1]

AC is inherited from the conditional-expectation and L2 interfaces. (The Axiom of Choice)

Proof

1.1A1F1F2F3givenchoose

By [F2], choose bounded predictable step processes Hn with E∫0T∣Hn−H∣2dA→0. For any m,n, [F1] gives E∣IT(Hn)−IT(Hm)∣2=E∫0T∣Hn−Hm∣2dA, so terminal integrals are Cauchy in L2(P); the same estimate on [0,t] gives the Cauchy property at every t≤T. [F3] gives a unique full-space limit and, since every It(Hn) is Ft-measurable, also an Ft-measurable limit at each fixed t; uniqueness makes these the same L2 class.

2.1F1F2F5step 1.1

If Kn is another step sequence converging to H, then E∫0T∣Hn−Kn∣2dA→0. Applying [F1] to Hn−Kn makes the terminal limits and each fixed-time limit equal in L2, so the limits in [F5] are independent of approximation.

2.2F1step 1.1algebra

Norm continuity and [F1] give, for every t≤T, E∣It(H)∣2=lim⁡nE∣It(Hn)∣2=lim⁡nE∫0tHn,s2dAs=E∫0tHs2dAs. This proves square integrability and the isometry.

3.1A1F1F4step 1.1step 2.1∎

For s≤t, [F1] gives E[It(Hn)∣Fs]=Is(Hn). By [F4], conditional expectations converge in L2 to E[It(H)∣Fs], while Is(Hn)→Is(H) in L2 by step 1.1; uniqueness of limits yields E[It(H)∣Fs]=Is(H). Hence the extension is a square-integrable martingale, with no claim for predictable integrands of infinite compensator energy.

Source notes

Bass describes the L2 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