---
title: L1 Formula in Poisson Analysis
url: https://www.emergentmind.com/topics/l1-formula
type: topic
---

# L1 Formula in Poisson Analysis

Searching arXiv for the specified paper and closely related Clark–Ocone/Poisson work.
arXiv search query: 2404.07541 Poisson imbedding meets the Clark-Ocone formula
The **\(L^{1}\) formula** in the setting of Poisson analysis is a Clark–Ocone-type representation for integrable Poisson functionals on a filtered probability space carrying a Poisson random measure. In the formulation developed in "Poisson imbedding meets the Clark-Ocone formula" [2404.07541], the representation extends the Poisson imbedding for point processes and differs from the classical Clark–Ocone formula in three explicit ways: it is written with respect to the Poisson measure rather than the compensated measure, it holds in \(L^{1}\) rather than \(L^{2}\), and its integrand is defined as a pathwise operator rather than as an \(L^{2}\)-limiting object. The resulting integrand is characterized as a predictable integrable process [2404.07541].

## 1. Probabilistic setting and statement of the formula

The representation is formulated on a filtered probability space carrying a Poisson random measure \(N\) on \(([0,T]\times\mathbb X,\mathcal B([0,T])\otimes\mathcal X)\) with intensity measure \(\mu=dt\otimes\pi\), where \(\pi\) is \(\sigma\)-finite and atomless. The predictable \(\sigma\)-field on \(\Omega\times[0,T]\times\mathbb X\) is denoted by \(\mathcal P\) [2404.07541].

In the finite-mass case, namely under the assumption
\[
\mu([0,T]\times\mathbb X)<\infty,
\]
the main \(L^{1}\)-representation theorem applies to any \(F\in L^{1}(\Omega,\mathcal F^{N})\). The theorem introduces the empty-configuration value
\[
F(\varnothing):=F(\omega)\qquad\text{whenever }\omega\text{ has }N([0,T]\times\mathbb X)=0,
\]
and then asserts that the random variable \(F\) admits the almost sure decomposition
\[
F
=
F(\varnothing)+\int_{[0,T]\times\mathbb X}\mathcal H_{(t,x)}F\,N(dt,dx).
\]
Equivalently,
\[
F \;=\; F(\varnothing)\;+\;\int_{[0,T]\times \mathbb X}
D_{(t,x)}F\bigl(\omega_{t^-}\bigr)\,N(dt,dx)
\quad\text{a.s.}
\]
The theorem further states that \(\mathcal HF\) belongs to \(\mathbb L^{1}_{\mathcal P}\), meaning that it is predictable and integrable against \(N\), and that the decomposition is unique: if
\[
F=c+\int Z_{(t,x)}\,N(dt,dx)
\]
for some \(c\in\mathbb R\) and \(Z\in\mathbb L^{1}_{\mathcal P}\), then necessarily \(c=F(\varnothing)\) and \(Z_{(t,x)}=\mathcal H_{(t,x)}F\) almost everywhere [2404.07541].

In this context, the label **\(L^{1}\)** refers to the integrability class of both the functional \(F\) and the predictable integrand, rather than to an \(\ell_{1}\)-norm construction or to an \(L^{1}\)-type time discretization.

## 2. Pathwise operators and the predictable integrand

The formula is built from two pathwise operations. The first is the usual add-one difference, or Malliavin operator,
\[
D_{(t,x)}F(\omega):=F(\omega+\delta_{(t,x)})-F(\omega).
\]
The second is truncation at time \(t\), defined by
\[
\tau_t:\omega\mapsto\omega_t:=\omega|_{[0,t)\times\mathbb X},
\]
that is, all atoms at times \(\ge t\) are removed. The integrand is then defined by composition:
\[
\mathcal H_{(t,x)}F(\omega):=D_{(t,x)}F(\omega_t).
\]
Because \(\tau_t(\omega)\) is measurable with respect to the left-limit \(\sigma\)-field \( \mathcal F^{N}_{t^-}\), the process \(\mathcal H_{(t,x)}F\) is \( \mathcal F^{N}_{t^-}\)-predictable by construction [2404.07541].

The ambient integrability space is
\[
\mathbb L^{1}_{\mathcal P}
=
\left\{
Z\text{ predictable }:\;
E\!\left[\int_{[0,T]\times\mathbb X}|Z_{(t,x)}|\,dt\,\pi(dx)\right]<\infty
\right\},
\]
so that \(\int Z\,N\) is well defined in \(L^{1}\) and almost surely [2404.07541].

This construction is technically significant because the integrand is not obtained through a projection or limiting procedure in a Hilbert space. Instead, it is a direct pathwise operator \(D\circ\tau\). A plausible implication is that the representation emphasizes the causal structure of the Poisson configuration: the value at \((t,x)\) is computed by adding an atom to the truncated past, rather than by conditioning a derivative taken on the full configuration.

## 3. Relation to the classical Clark–Ocone formula

The representation differs from the classical Clark–Ocone formula on three stated accounts. First, it is expressed with respect to the **Poisson measure** \(N(dt,dx)\) itself, not the compensated measure. Second, it holds in **\(L^{1}\)** and not in **\(L^{2}\)**. Third, the integrand is a **pathwise operator** and not an \(L^{2}\)-limiting object [2404.07541].

These differences are structural rather than cosmetic. The classical Clark–Ocone framework is ordinarily associated with martingale decompositions and compensated stochastic integrals, whereas the present formula is tailored to uncompensated Poisson integration. The paper explicitly identifies the result as a **Pseudo-Clark–Ocone representation formula**, and the proof uses Malliavin calculus together with a pseudo-chaotic decomposition with uncompensated iterated integrals [2404.07541].

The theorem therefore occupies a distinct position between two traditions. On one side lies the classical Clark–Ocone formula, which is centered on compensated noise and \(L^{2}\)-methods; on the other lies Poisson imbedding for point processes, which is inherently uncompensated and pathwise. The new formula connects these by showing that an \(L^{1}\), uncompensated, predictable representation is available for any integrable Poisson functional.

## 4. Proof architecture and pseudo-chaotic expansion

The proof proceeds through a pseudo-chaotic expansion. For any square-integrable \(F\), Theorem 3.1 gives
\[
F = F(\varnothing) + \sum_{n=1}^\infty \frac1{n!}\,I_n(\,{}_nF),
\]
almost surely, where \({}_nF(x_1,\dots,x_n)\) is the \(n\)-th pathwise difference at the empty path and \(I_n(\cdot)\) denotes the \(n\)-fold integral against the factorial measure \(N^{(n)}\) [2404.07541].

The argument then introduces finite-chaos approximants by truncating the series at level \(K\). For each such approximation,
\[
F^K = F^K(\varnothing) + \int \mathcal H F^K\,N,
\]
and the integrand \(\mathcal H F^K\) is computed explicitly term by term. At this stage it is manifestly predictable and belongs to \(\mathbb L^{1}\) [2404.07541].

The passage from finite chaos to general \(L^{1}\)-functionals uses an \(L^{1}\)-approximation argument. By Lemma 4.1, the operators \(\mathcal H_{(t,x)}\) are continuous in \(L^{r}\) for \(r\in[1,2]\), so \(\mathcal H F^K\to \mathcal H F\) in \(\mathbb L^{1}\). The stochastic integrals then converge in \(L^{1}\), yielding the desired decomposition for \(F\in L^{1}(\Omega)\). Uniqueness follows by pathwise difference arguments: any other predictable integrand must agree with the pathwise quantity \(D_{(t,x)}F\circ\tau_t\) [2404.07541].

The proof strategy is notable because it avoids compensators and avoids identifying the integrand as an orthogonal projection. This suggests a reformulation of Poisson representation theory in which uncompensated iterated integrals and pathwise truncation replace the more familiar \(L^{2}\)-martingale machinery.

## 5. Poisson imbedding as an illustrative example

The paper’s main example concerns a point process \(H\) on \(\mathbb R_{+}\) with predictable intensity \(\lambda_t\). By standard thinning,
\[
H_T = \int_{(0,T]\times\mathbb R_{+}} \mathbf 1_{x\le \lambda_t}\,N(dt,dx).
\]
Direct computation yields
\[
D_{(t,x)}H_T(\omega)=\mathbf 1_{x\le\lambda_t(\omega)}+(\text{higher-order }N\text{-terms}),
\]
and after truncation these higher-order terms disappear:
\[
\mathcal H_{(t,x)}H_T
=
D_{(t,x)}H_T(\omega_t)
=
\mathbf 1_{x\le\lambda_t(\omega)}.
\]
Accordingly, the Pseudo-Clark–Ocone formula reduces exactly to
\[
H_T
=
H_T(\varnothing)
+
\int_{[0,T]\times[0,\infty)} \mathbf 1_{x\le\lambda_t}\,N(dt,dx),
\]
which is the classical Poisson-imbedding formula [2404.07541].

This example clarifies the operational meaning of the integrand. In the present framework, the correct predictable integrand is obtained by the simple pathwise difference at time \(t\). The paper contrasts this with the standard Clark–Ocone integrand, for which one would have to take conditional expectations of the full future term and obtain a more cumbersome expression [2404.07541]. The example therefore serves not merely as an application but as an explanation of why the pathwise operator \(D\circ\tau\) is the natural integrand in the uncompensated \(L^{1}\) setting.

## 6. Scope, terminology, and conceptual significance

The theorem identifies a representation for **any integrable Poisson functional** in the finite-mass case. Its output is a predictable integrable process, and its normalization term is the empty-configuration value \(F(\varnothing)\) [2404.07541]. These two ingredients replace the more familiar pair consisting of expectation and compensated stochastic integral.

A frequent source of ambiguity is the phrase **\(L^{1}\) formula**. Here it does not denote an \(\ell_{1}\)-penalized variational principle, an entrywise \(\ell_{1}\)-norm, or the classical L1 finite-difference formula for Caputo derivatives. Rather, it denotes a representation theorem valid under \(F\in L^{1}(\Omega)\), with the integrand belonging to \(\mathbb L^{1}_{\mathcal P}\). The distinction from the \(L^{2}\)-based Clark–Ocone theory is explicit in the statement of the result [2404.07541].

The conceptual contribution can be summarized in three linked features. The representation is uncompensated, pathwise, and uniquely determined by truncation plus add-one difference. This suggests that the theorem is not only an extension of Poisson imbedding, but also a reorganization of Poisson Malliavin calculus around predictable pathwise operators. Within that perspective, the formula
\[
F = F(\varnothing)+\int \mathcal H_{(t,x)}F\,N(dt,dx)
\]
is the central identity: it expresses an arbitrary integrable Poisson functional as its value on the empty configuration plus the accumulated predictable effect of adding atoms to the past.

Source: https://www.emergentmind.com/topics/l1-formula