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

Calibrated diagonal lifts and transition phase differences

Definition

Let H=Cd be a finite operator space with specified orthonormal basis {∣x⟩}x=1d, where d≥1. For specified real numbers dx, the diagonal lift is the linear operator D=∑xdx∣x⟩⟨x∣. Its phase evolution at real time t, in units with ℏ=1, is Ut=e−itD, acting on an operator X by X↦UtXUt†. In particular, the matrix unit ∣x⟩⟨y∣ acquires the phase e−it(dx−dy).

If an unperturbed Hamiltonian H0 is diagonal in this same basis with eigenvalues Ex, define the directed transition energy for x→y as the source energy minus the destination energy. Replacing H0 by H0+D changes this difference from Ex−Ey to (Ex−Ey)+(dx−dy); the lift contribution is therefore dx−dy.

For the calibration criterion, a recovery rule is a supplied parameterized family of quantum channels Ra,τ:L(HR)→L(HL), indexed by (a,τ)∈A, where HR and HL are specified nonzero finite operator spaces, L(K) denotes the linear endomorphisms of K, and A⊆Rd×[0,∞) is a specified nonempty set of admissible lift vectors and elapsed intervals. Any auxiliary inputs, such as a recorded outcome, are fixed or supplied separately. The phase data are calibrated for this rule at an admissible pair (a,τ) with a=(d1,…,dd) when the actual vector a and interval τ are supplied as explicit inputs and the rule evaluates the specified channel Ra,τ. Each channel is complex-linear, completely positive and trace-preserving; the word recovery specifies its intended use and supplies no correction guarantee or physical control assumption.

This availability is an assumption about the rule's inputs, not a claim that an unknown jump time has been observed. An unknown jump time remains a variable; averaging over it requires a separately specified probability distribution.

When probabilistic averaging is invoked, the additional inputs are a probability space (T,T,μ) of allowed real times T⊆R and a specified μ-integrable real or complex scalar function f on T. The probability measure μ is the jump-time distribution, and the average means the expectation Eμ[f]=∫Tf dμ. Neither this distribution nor a choice of f is supplied by calibration alone.

Facts & Assumptions

[F1]

In the finite operator conventions, ∣x⟩⟨y∣ maps v to ∣x⟩⟨y∣v⟩, and the adjoint is the conjugate transpose in the specified bases. Finite operator and ket conventions

[F2]

Every finite-dimensional normed space is Banach and every linear map from such a space to a normed space is bounded. Every finite-dimensional normed space is Banach A linear map from a finite-dimensional normed space is bounded

[F3]

For a bounded linear operator A on a complex Banach space, etA=∑n=0∞tnAn/n! converges in operator norm for real t. The exponential series of a bounded operator

[F4]

For every z∈C, the scalar exponential is ez=exp⁡z=∑n=0∞zn/n!; for all complex z,w, ez+w=ezew. The complex exponential by its power series exp(z+w)=exp z exp w, and the complex exponential extends the real exponential

[F5]

A quantum channel between finite-dimensional complex inner-product spaces is a complex-linear, completely positive, trace-preserving map on their full operator spaces; the definition assumes no physical realization. Finite-dimensional quantum channel

[F6]

A probability measure on a measurable space has total mass one. On a probability space (T,T,μ), the expectation of a specified μ-integrable real or complex scalar function f is the finite integral ∫Tf dμ. Probability measures and probability spaces Expectation of a nonnegative or integrable random variable

Justification

Given: The finite operator space, basis and real diagonal data in the definition, real t, and, for calibration, the supplied channel family and admissible input pair. When probabilistic averaging is invoked, also the supplied probability space and integrable scalar function in the definition.

Goal: Verify the phase evolution and transition difference, the typing of the calibration criterion, and the meaning of the averaging caveat.

1.1 By the basis action in [F1], D∣x⟩=dx∣x⟩ and Dn∣x⟩=dxn∣x⟩ for every nonnegative integer n. The space H, with its standard norm, is Banach and −iD is bounded by [F2], so [F3] applies. Acting with its norm-convergent series on each basis vector and using the scalar series in [F4] gives Ut∣x⟩=e−itdx∣x⟩. [F1, F2, F3, F4, algebra]

1.2 At a supplied admissible pair (a,τ), the given family assigns a channel Ra,τ with the source and target operator spaces in [F5]. Evaluating this supplied family defines the rule's use of the known lift vector and interval. It introduces no assertion that a corrective channel family exists for an unspecified noise model, that physical control is available, or that an unknown jump time or its distribution has been supplied. [given, F5]

2.1 For z∈C write pN(z)=∑n=0Nzn/n!. Conjugating the finite sum gives pN(z)‾=pN(z‾), and ∣pN(z)‾−ez‾∣=∣pN(z)−ez∣→0 by [F4]. Thus ez‾=ez‾. Since t,dy are real, the diagonal matrix from step 1.1 and the conjugate transpose in [F1] give Ut†∣y⟩=eitdy∣y⟩. [F1, F4, step 1.1, algebra]

3.1 For every basis vector ∣z⟩, the three factors in Ut∣x⟩⟨y∣Ut† give e−itdxeitdy∣x⟩⟨y∣z⟩=e−it(dx−dy)∣x⟩⟨y∣z⟩ by [F4]; equality on the basis proves the asserted matrix-unit action. When H0∣x⟩=Ex∣x⟩, (H0+D)∣x⟩=(Ex+dx)∣x⟩, and subtracting the destination eigenvalue from the source eigenvalue gives the stated transition shift. [F1, F4, step 1.1, step 2.1, algebra]

4.1 With the additional averaging inputs in the definition, [F6] applies to f on (T,T,μ) and defines its finite average as ∫Tf dμ. This operation uses the specified measure μ as well as f; neither is an input furnished by the calibration criterion itself. Thus the averaging caveat is a requirement to supply a probability model, not a probability law inferred from the channel family or an observation of the unknown time. [given, F6] ∎

Depends on

Used by · 14

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.