Paper VIReading edition

The transfer-semigroup realization

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

1 The transfer-semigroup realization

Let \(X\) be a finite-dimensional real or complex vector space, let \(A\in\operatorname{End}(X)\), and let \(s\in X\) be a primitive seed. The basic continuous transfer is

\[ T(t)=e^{tA},\qquad t\ge 0, \]

while a positive operator \(L\) is more naturally written

\[ H(t)=e^{-tL}. \]

Both satisfy the semigroup law. The sign convention changes with the domain: Markov generators and evolution equations are usually written with \(e^{tA}\); positive diffusion and elliptic operators are usually written with \(e^{-tL}\).

The common operator chain is

\[ \boxed{ \text{seed}\longrightarrow\text{transfer}\longrightarrow\text{project} \longrightarrow\text{condition}\longrightarrow\text{refine} \longrightarrow\text{complete}\longrightarrow\text{reconstruct}. } \]
The common operator language used throughout the paper. Semigroups, resolvents, normalized Bayesian maps, and fractional powers are distinct realizations of the same transfer stage.
The common operator language used throughout the paper. Semigroups, resolvents, normalized Bayesian maps, and fractional powers are distinct realizations of the same transfer stage.

View full-size figure (new tab)

Definition 1.1: Transfer-semigroup seed system

A finite transfer-semigroup seed system is a tuple

\[ \mathfrak S=(X,s,A,\{P_\alpha\}_{\alpha\in I},\tau), \]

where \(X\) is the state space, \(s\) is the seed, \(A\) is a transfer generator, the \(P_\alpha\) are pairwise orthogonal idempotents summing to the identity, and \(\tau\) specifies the topology in which a completion or limit is interpreted.

Theorem 1.2: Finite semigroup law

For every matrix \(A\) and all \(s,t\in{\mathbb R}\),

\[ \boxed{e^{(s+t)A}=e^{sA}e^{tA}.} \]

Moreover, \(T(0)=I\) and \(T'(t)=AT(t)=T(t)A\).

Proof of Theorem 1.2

Both exponentials are absolutely convergent matrix power series. Since every power of \(A\) commutes with every other power, the Cauchy product gives

\[ e^{sA}e^{tA} =\sum_{m,n\ge0}\frac{s^mt^n}{m!n!}A^{m+n} =\sum_{r\ge0}\frac{(s+t)^r}{r!}A^r. \]

Termwise differentiation is valid in finite dimension and gives the derivative identities.

Boundary 1.3: Infinite-dimensional generators

For an unbounded operator, writing \(e^{tA}\) is not a definition unless a semigroup-generation theorem applies. The finite matrix identities in this paper remain algebraically correct models, but a continuum realization must state the operator domain, closure, growth bound, and topology of convergence.

Source and conversion record

Source SHA-256: 736e615131f57daf341b6cb0600761d58950450947c85d433206148cca228333

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 Paper VI

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