Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

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.

Depends on

Used by

Dependency tree · two levels

39 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