Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-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.

Jump correlators and bath-memory parameters

PDF p. 9: Eq. (S2.2) and following paragraph: coupling convention; PDF p. 10: Eqs. (S2.7)–(S2.10)

Definition

Assume the Axiom of Choice and Countable Choice, and use the bath correlation and spectral-density convention in which Jαβ(ω)=(2π)−1∫RJαβ(t)eiωt dt. Here α,β=1,…,n label a finite positive number n of bath coupling channels. Assume the traces and entrywise integrability required for this spectral density, and suppose that J(ω) is Hermitian positive semidefinite for every real ω.

The frequency-domain jump correlator is g(ω)=[J(ω)/(2π)]1/2, the unique Hermitian positive semidefinite square root. If its entries are Lebesgue integrable, its time-domain jump correlator is g(t)=∫Rg(ω)e−iωt dω, entrywise. For an n×n matrix M, define the mixed norm ∥M∥2,1=∑b=1n(∑α=1n∣Mαb∣2)1/2.

Let γ>0 be the coupling parameter in Hint=γ∑α=1nXα⊗Bα, in units ℏ=1, for a finite-dimensional system and Hermitian coupling operators with system operator norms ∥Xα∥≤1. The Bα are the same bath operators used to construct J above. For unbounded bath operators, a concrete Hamiltonian application requires an appropriate common domain and self-adjoint realization. This uses the interaction convention of the system–bath postulate; its Gaussianity, preparation and short-memory assumptions are additional conditions for a ULE approximation, not requirements for defining the quantities below.

Assume 0<I0<∞ and I1<∞, where I0=∫R∥g(t)∥2,1 dt and I1=∫R∣t∣ ∥g(t)∥2,1 dt. Define Γ=4γI02 and τB=I1/I0. Equivalently, the numerator of τB is ∫R∥tg(t)∥2,1 dt. The article interprets Γ as an upper bath-induced evolution rate and τB as a characteristic bath-correlation time; its notation distinguishes τB from checking time, the interval used for error checks. These interpretations do not by themselves establish a dynamical bound.

Facts & Assumptions

[F1]

The bath-correlator definition supplies the finite-channel correlation and spectral-density convention when its trace and integrability conditions hold, under the stated choice assumptions. Bath correlation matrix and Fourier convention

[F2]

For a finite-dimensional positive semidefinite operator, the support spectral construction gives a basis-independent positive square root. Finite support square roots and generalized inverses

[F3]

The stationary-spectrum kernel contract specifies the entrywise Fourier integral, mixed norm and finite nonzero zeroth and finite first kernel moments used here. Stationary correlation spectra and ULE kernel regularity

[F4]

The system–bath coupling postulate supplies the convention Hint=γ∑α=1nXα⊗Bα for Hermitian coupling operators with γ>0 and ∥Xα∥≤1. Its bath operators are identified with those in [F1]. Only this interaction convention is used here; no ULE approximation is invoked. ULE system–bath coupling and short bath memory

[A1]

Assume the Axiom of Choice and Countable Choice as required by the bath-correlator interface. The Axiom of Choice The Axiom of Countable Choice (AC_ω)

Justification

Given: The bath and choice assumptions, positive semidefinite spectral matrix, entrywise integrability of its square-root kernel, and the stated moment conditions.

Goal: Show that the displayed correlators and parameters are well defined under these assumptions.

1.1 By [F1], the spectral matrix is defined entrywise. At each real frequency it is finite-dimensional and positive semidefinite, so [F2] supplies its basis-independent positive square root after division by the positive scalar 2π. The assumed entrywise integrability and [F3] then give a finite matrix g(t) for every real t. [given, A1, F1, F2, F3]

2.1 By [F4], γ is the positive parameter of the stated interaction convention. The finite sums in the mixed norm are defined for every such matrix. By the assumed moment conditions, I0 is finite and strictly positive and I1 is finite; hence Γ and τB are finite and the latter has a nonzero denominator. Since t is real, direct substitution into the mixed norm gives ∥tg(t)∥2,1=∣t∣∥g(t)∥2,1, establishing the equivalent numerator. [given, F3, F4, step 1.1, algebra] ∎

Depends on

Used by · 3

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.

Sources