Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

A CLE can assign negative density near an empty population

Example

Assume the Axiom of Choice. Consider constant immigration ∅→A with density jump 1/V and rate Vλ, where V≥1, λ>0, and the time horizon T>0. Let NT be the count of a homogeneous Poisson point process on (0,T] with intensity Vλ times Lebesgue measure, and set XT=NT/V. For the associated constant-coefficient CLE, let B be a standard Brownian motion and set Zt=λt+λ/V Bt. Its generator is GVf(x)=λf′(x)+λ2Vf′′(x), and, with μ=λT, its terminal marginal is ZT=μ+μ/V G,G∼N(0,1). Then XT≥0 almost surely, while the CLE marginal can be negative.

Facts & Assumptions

Given: AC, V≥1, λ,T>0, the exact jump-count construction, the Brownian motion used to define Z, and the count and density-scaled model laws.

[F1]

Finite-intensity Poisson-process existence and mixed-binomial law: a Poisson point process on a finite-intensity time interval exists, and its total count is Poisson with parameter equal to the intensity of that interval.

[F2]

Poisson and Cox point processes: counts on disjoint Borel sets of a Poisson point process are independent and have Poisson laws with their respective intensity parameters.

[F3]

The scalar Poisson count law and Normalization, moments, and generating function of the Poisson count law: a count with law Pois⁡(m) has masses e−mmk/k!, mean m, and E[N(N−1)]=m2.

[F4]

Density-scaled reaction jump and chemical Langevin generators: a jump of size ν/V at rate Va(x) has generator Va(x)(f(x+ν/V)−f(x)); its CLE coefficients are the drift νa(x) and covariance rate a(x)ννT/V.

[F5]

Standard normal and normal laws: the law N(0,1) has density φ(u)=e−u2/2/2π on R.

[F6]

Under AC, a standard continuous Brownian motion exists, and its increments over finite increasing time grids are independent normal variables with variance equal to the time increments. Brownian motion Existence of continuous Brownian motion

[F7]

With the usual augmented natural filtration, the conditional law of the Brownian future depends on the past only through the current Brownian state. Future-path Markov property

[A1]

The normal-law and Brownian constructions use AC, recorded as The Axiom of Choice.

Verification

Given: The inputs above, with m=Vμ.

1.1F1F2F3F4algebra

By [F1], NT∼Pois⁡(m), so XT=NT/V≥0 almost surely. The point-process counts on disjoint intervals are independent by [F2]. On an interval of length h, put r=Vλh. By [F3], P(K=0)=e−r=1−r+O(r2) and P(K=1)=re−r=r+O(r2); also P(K≥2)≤E[K(K−1)]/2=r2/2. For bounded f, the multiple-count contribution to its expected increment is therefore O(h2)∥f∥∞. Dividing the zero/single-count expansion by h gives the density-count generator Vλ(f(x+1/V)−f(x)), as in [F4].

1.2F5F6F7A1algebra

Let B be the Brownian motion in [F6] and define Zt=λt+λ/V Bt. By [F7] and the independent increments in [F6], Z is a continuous Markov process. For any f with three bounded continuous derivatives, put Δh=λh+λ/V(Bt+h−Bt). The Brownian increment is independent of the past and has variance h. The density in [F5] has finite third absolute moment by substituting v=u2/2, so E[Δh]=λh,E[Δh2]=λhV+λ2h2,E∣Δh∣3=O(h3/2). Taylor's formula therefore gives lim⁡h↓0E[f(x+Δh)]−f(x)h=λf′(x)+λ2Vf′′(x), the generator in the Example. Also BT∼N(0,T) by [F6], so G=BT/T∼N(0,1) and ZT=μ+μ/V G.

2.1F5A1step 1.2algebra

The density φ in [F5] is even. The moments of orders one and three are absolutely integrable, as follows by substituting v=u2/2 in the tail integrals, so symmetry gives EG=EG3=0. Since φ′(u)=−uφ(u) and uφ(u)→0 at both infinities, integration by parts gives E[G2]=∫Ru2φ(u) du=∫Rφ(u) du=1. Expanding the Gaussian marginal in step 1.2 now gives E[ZT3]=μ3+3μ2/V.

2.2F3step 1.1algebra

Reindexing the nonnegative Poisson mass series gives E[NT(NT−1)(NT−2)]=e−m∑k=3∞k(k−1)(k−2)mkk!=m3e−m∑r=0∞mrr!=m3. Using [F3] and N3=N(N−1)(N−2)+3N(N−1)+N yields E[XT3]=μ3+3μ2V+μV2.

3.1step 2.2step 2.1algebra

Subtracting the two moments in steps 2.2 and 2.1 gives E[XT3]−E[ZT3]=μ/V2>0. Thus this exact marginal comparison has a weak discrepancy of order V−2 for the cubic payoff.

4.1A1F5step 1.1step 1.2algebra∎

The CLE value is negative exactly when G<−Vμ. The normal density is strictly positive on every nonempty interval, so this event has positive probability. As Vμ↓0, continuity of the normal distribution and symmetry give P(ZT<0)=P(G<−Vμ)⟶12. The jump marginal remains nonnegative by step 1.1.

Notes

The cubic payoff is unbounded, so its exact discrepancy is not an application of Stopped density-scaled jump versus chemical Langevin weak model error, whose general estimate requires a bounded payoff and a smooth stopped backward solution. This example separates a solvable marginal calculation from that theorem's hypotheses.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

63 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