Large Signal ModelReading edition

77. Comparing a model with a process outside its representation

Reading tools
Reading libraryFind statementsInspect Lean
Switch work

Saved reading

Read side by side

Start reading

Resources & source

Original TeX with line links · Download TeX

The wording and mathematics follow the retained manuscript. This reading format does not add a proof review or extend Lean coverage.

Skip contents and start reading

77. Comparing a model with a process outside its representation

The earlier operator-norm law bounds compare two models on one common probability cone. A misspecified generating process may not have a representation in the fitted cone. It is useful to state the more basic comparison at the level of conditional observation laws.

Let \(P\) be any causal process on a standard Borel observation space with finite actions. Let \(Q\) be a proposed process. Both use the same measurable policy. Write \(P_t(\cdot\mid h,a)\) and \(Q_t(\cdot\mid h,a)\) for their next-observation kernels, and define

\[ d_t(h,a)=\|P_t(\cdot\mid h,a)-Q_t(\cdot\mid h,a)\|_{\mathrm{TV}}. \]

The proposed kernel must be specified on every history needed for the comparison, including histories impossible under \(Q\) but possible under \(P\). A declared fallback on a model-null history completes a causal kernel without changing \(Q\)'s own law. An implementation that rejects such a history must report that rejection rather than silently claim to have filtered it.

Proposition 69: Observation-law error without a shared state space

With the same initial history, the length-\(T\) joint action-and-observation laws satisfy

\[ \boxed{ \|P_T-Q_T\|_{\mathrm{TV}} \leq\min\left(1,\sum_{t=0}^{T-1} \mathbb E_{P,\pi}[d_t(H_t,A_t)]\right). } \]

An initial-history discrepancy adds its total variation. In particular, uniform bounds \(d_t(h,a)\leq\epsilon_t\) give the upper bound \(\min(1,\sum_{t<T}\epsilon_t)\).

Proof

Introduce hybrid laws that follow \(P\) for the first \(t\) transitions and \(Q\) for the rest, with the common policy throughout. Two successive hybrids have the same \(P\) prefix distribution up to time \(t\) and the same future \(Q\) kernel after the next transition. Conditional on that prefix and its policy-chosen action, changing the next kernel costs \(d_t(h,a)\) in total variation. A common continuation kernel cannot increase total variation, because integration of a test bounded between zero and one produces another such test. Average over the shared prefix, sum the adjacent-hybrid bounds, and cap by one. The same contraction argument handles a different initial law. \(\square\)

This theorem does not make the right-hand side observable without further assumptions. Proposition 68 supplies lower evidence about visited conditional discrepancies, not an upper estimate for every future history. Turning a finite collection of residuals into an upper law guarantee requires additional regularity, coverage or a restricted class with a separating test family.

The distinction prevents a common logical jump: a model can pass several tests and still have a large untested discrepancy. Conversely, a statistically significant residual need not mean that its internal probability algebra is invalid. The model can be a valid distribution and an inadequate approximation at the same time.

Source and conversion record

Source SHA-256: 0173ab16e349b8778dc66f60f59820f40f800cff75e2223de07dcc1a84af18ff

Unsupported prose commands stop the build. The mathematical expression sequence is checked against the source, with manuscript macros expanded for display.

Conversion records

Notation in Large Signal Model

Look up a symbol without leaving this chapter. Select text before opening help to search for it.

Search this work’s notation.

    Symbols can have different meanings in different passages. Read each result in its own context.

    Open the full notation index