Alphabeta Math
Pipeline-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.

Variational approximation, residual certificates and propagation errors

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

AlgorithmAlgorithm: AI-adaptedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

Conforming Rayleigh–Ritz procedure

Definition

Let H be a nonzero complex Hilbert space whose inner product is linear in its first argument. Let Q⊆H be a dense linear subspace, and let q:Q×Q→C be a Hermitian sesquilinear form: it is linear in its first argument, conjugate-linear in its second, and q(u,v)=q(v,u)‾ for all u,v∈Q. In particular, q(u,u)∈R. Write q[u]=q(u,u). Assume q[u]≥−c∥u∥2 for some real c≥0, and assume Q is complete in the form norm ∥u∥q,c2=q[u]+(c+1)∥u∥2; this is the meaning of a closed semibounded form here.

For an integer n≥1, let ϕ1,…,ϕn∈Q be linearly independent. The exact input matrices are the Gram matrix G and form matrix A with entries

Gij=⟨ϕj,ϕi⟩,Aij=q(ϕj,ϕi)(1≤i,j≤n).

For every nonzero coefficient vector z∈Cn, z∗Gz=∥∑jzjϕj∥2>0, so G is positive definite; the symmetry of q makes A Hermitian.

The procedure is:

  1. Form G and A from the supplied vectors and form, using exact entries.
  2. Diagonalize the positive definite Hermitian matrix G and form its unique positive inverse square root G−1/2. Set B=G−1/2AG−1/2.
  3. Diagonalize the Hermitian matrix B, listing its real eigenvalues ρ1≤⋯≤ρn with multiplicity and selecting an orthonormal eigenbasis y1,…,yn. For each j, set cj=G−1/2yj and return (ρj,cj).

Repeated eigenvalues may return any orthonormal basis of the corresponding eigenspace. The procedure uses trial vectors in Q and does not require them to lie in the operator domain of an associated self-adjoint operator. It operates on exact matrix entries: if quadrature or an approximate eigensolver supplies numerical data, this procedure alone supplies no error enclosure or certification for those approximations.

Remarks

Conformity means exactly that each trial vector lies in the stated form domain. A nonconforming grid vector is not automatically an element of that continuum form domain. The procedure returns the exact eigenvalues of its supplied matrices; any certified numerical Ritz interval must enclose integration error in both G and A and include the numerical eigensolver error separately.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Conforming Ritz eigenvalue upper bounds

Statement

Assume the Axiom of Choice and Countable Choice. Let H≠{0} be a complex Hilbert space, let A=A∗ satisfy A≥−cI for some c≥0, and set Q(A)=D((A+cI)1/2). Define the associated closed form by

qA(u,v)=⟨(A+cI)1/2u,(A+cI)1/2v⟩−c⟨u,v⟩(u,v∈Q(A)).

Let σess(A) be the essential spectrum, the complement in σ(A) of isolated eigenvalues of finite multiplicity, and put α=inf⁡σess(A), with α=+∞ when this set is empty. For k≥1, define

λk(A)=inf⁡L⊆Q(A) linear, dim⁡L=k sup⁡u∈L∥u∥=1qA[u],qA[u]=qA(u,u),

where the infimum over an empty family is +∞. For a finite-dimensional conforming subspace V⊆Q(A) and 1≤k≤dim⁡V, define its kth Ritz value

θk(V)=inf⁡L⊆V linear, dim⁡L=k sup⁡u∈L∥u∥=1qA[u].

Then θk(V)≥λk(A). If V1⊆V2⊆⋯⊆Q(A) are finite-dimensional subspaces whose union is dense in Q(A) in the form norm ∥u∥Q(A)2=qA[u]+(c+1)∥u∥2, then for every fixed k with λk(A)<α the values θk(Vn), defined once dim⁡Vn≥k, decrease to λk(A), the kth isolated eigenvalue below the essential spectrum counted with multiplicity.

Facts & Assumptions

Given: Choice and Countable Choice; H,A,c,Q(A),qA,α, and λk(A) as in the Statement; conforming finite-dimensional subspaces V⊆Q(A) and a nested sequence (Vn) dense in the form norm.

[A1]

Choice and Countable Choice are the set-theoretic assumptions used by the stated form min–max supplier (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

[F1]

The discrete spectrum consists of isolated eigenvalues of finite multiplicity; the essential spectrum is its complement in σ(A), and α=inf⁡σess(A) with the empty-set convention (Discrete and essential spectrum of a self-adjoint operator).

[F2]

For a self-adjoint A≥−cI, the form domain is Q(A)=D((A+cI)1/2), its form norm is ∥u∥Q(A)2=qA[u]+(c+1)∥u∥2, and λk(A) is the infimum over all k-dimensional form subspaces; when λk(A)<α, it is the kth eigenvalue below α, counted with multiplicity (Form min-max below the essential spectrum).

[F3]

Put S=(A+cI)1/2, defined by the real Borel functional calculus on σ(A)⊆[−c,∞). Then S is self-adjoint, D(S)=Q(A), and the product rule gives S2=A+cI with D(S2)=D(A): indeed, the respective spectral integrability conditions are ∫(x+c) dμu(x)<∞ and ∫(x+c)2 dμu(x)<∞, and the latter is equivalent to ∫x2 dμu(x)<∞ because x≥−c and μu is finite. The shifted form a(u,v)=qA(u,v)+(c+1)⟨u,v⟩=⟨Su,Sv⟩+⟨u,v⟩ is an inner product and its norm satisfies ∥u∥Q(A)2=∥Su∥2+∥u∥2, the graph norm of the closed operator S, so Q(A) is complete and qA is closed. Thus for u∈D(A) and v∈Q(A), Su∈D(S) and self-adjointness of S gives qA(u,v)=⟨Su,Sv⟩−c⟨u,v⟩=⟨S2u,v⟩−c⟨u,v⟩=⟨Au,v⟩. This uses the first-variable-linear inner-product convention and the spectral theorem and unbounded Borel functional calculus (Spectral theorem for unbounded self-adjoint operators (PVM form), Unbounded Borel functional calculus: domains, products, spectral mapping).

[F5]

The Cauchy–Schwarz inequality holds for the form inner product and the Hilbert-space inner product (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[F6]

On a basis of a conforming finite subspace, the procedure forms the exact Gram matrix G and form matrix M, sets B=G−1/2MG−1/2, selects an orthonormal eigenbasis Byj=ρjyj ordered by ρ1≤⋯≤ρm, and returns cj=G−1/2yj (Conforming Rayleigh–Ritz procedure).

Proof

1.1F3F4F6algebra

Fix V with m=dim⁡V≥k. Choose a basis ϕ1,…,ϕm of V and use [F6], writing Mij=qA(ϕj,ϕi) to distinguish the form matrix from the operator A. The Hermitian identity for qA follows from its defining inner products; [F3] verifies the remaining closed-form input conditions. For z≠0, z∗Gz=∥∑iziϕi∥2>0. By [F4], diagonalizing G gives the positive square root G1/2 and its inverse G−1/2, both Hermitian, and G1/2G−1/2=I. Multiplying G−1/2MG−1/2yj=ρjyj by G1/2 gives Mcj=ρjG1/2yj=ρjGcj, and cj∗Gcl=yj∗G−1/2GG−1/2yl=yj∗yl=δjl. Conversely Mc=ρGc implies B(G1/2c)=ρG1/2c, so these are all generalized eigenvalues with multiplicities. Their linear combinations ej:=∑i=1m(cj)iϕi form an orthonormal eigenbasis of V: Gram normalization gives orthonormality, and the coefficient eigenvalue equation gives qA(ej,ei)=ρjδij. For any k-dimensional L⊆V, the dimension formula forces L∩span⁡{ek,…,em}≠{0}; a unit vector in this intersection has form value at least ρk. The subspace span⁡{e1,…,ek} has supremum exactly ρk. Hence θk(V)=ρk, the kth generalized Ritz eigenvalue.

1.2A1F1F2givenchoosealgebra

Suppose λk(A)<α. By [F2], λ1≤⋯≤λk=λk(A) are the first k isolated eigenvalues below α, counted with multiplicity. Each corresponding eigenspace is finite-dimensional by [F1]. If x≠0 is an eigenvector with eigenvalue λ, self-adjointness gives λ∥x∥2=⟨Ax,x⟩=⟨x,Ax⟩=λ‾∥x∥2, so λ is real. For x∈ker⁡(A−λiI) and y∈ker⁡(A−λjI) with λi≠λj, this reality and self-adjointness give λi⟨x,y⟩=⟨Ax,y⟩=⟨x,Ay⟩=λj⟨x,y⟩, so the eigenspaces are orthogonal. Within each finite-dimensional eigenspace choose an orthonormal basis and take as many vectors as its multiplicity among λ1,…,λk; concatenating these finite lists gives orthonormal eigenvectors u1,…,uk∈D(A) with Auj=λjuj.

2.1A1F2step 1.1

Every k-dimensional subspace of V is a k-dimensional subspace of Q(A), so the infimum defining θk(V) is over a subfamily of the one defining λk(A). Therefore θk(V)≥λk(A).

2.2F3step 1.2algebra

For u=∑j=1kcjuj with ∑j∣cj∣2=1, orthonormality gives ∥u∥=1, while [F3] gives qA(uj,ui)=⟨Auj,ui⟩=λjδij. Hence qA[u]=∑jλj∣cj∣2≤λk(A).

3.1step 2.1algebra

For nested Vn, every k-subspace of Vn is a k-subspace of Vn+1; thus θk(Vn+1)≤θk(Vn). By step 2.1 this sequence is bounded below by λk(A), so it has a limit at least λk(A).

3.2A1F5step 2.2givenalgebra

Let ε>0 and put M=(∑j=1k∥uj∥Q(A)2)1/2. For each j, density gives an approximation from some Vnj; taking N=max⁡jnj and using nesting, choose all wj∈VN with ∥wj−uj∥Q(A)<δ. For coefficients c with ∑j∣cj∣2=1, put w=∑jcjwj and u=∑jcjuj. Then ∥w−u∥Q(A)≤kδ and ∥u∥=1, so ∥w∥≥1−kδ; taking kδ<1/2 ensures the wj are linearly independent. Writing a(x,y)=qA(x,y)+(c+1)⟨x,y⟩, [F5] and a[x]≥∥x∥2 give ∣qA(x,y)∣≤(c+2)∥x∥Q(A)∥y∥Q(A). Since ∥u∥Q(A)≤M and ∥w∥Q(A)≤M+kδ, this yields ∣qA[w]−qA[u]∣≤(c+2)kδ(2M+kδ) uniformly in c. Also ∣∥w∥2−1∣≤kδ(2+kδ) uniformly, so for sufficiently small δ, ∥w∥2≥1/2. The bound just proved for qA[w]−qA[u] and the uniform bound ∣qA[u]∣≤max⁡j∣λj∣ then show that qA[w]/∥w∥2 converges uniformly to qA[u]. The values qA[u]=∑jλj∣cj∣2 are at most λk(A) by step 2.2; hence choose δ small enough that every such w satisfies qA[w]/∥w∥2≤λk(A)+ε.

4.1step 3.1step 3.2step 2.1algebra∎

The span of w1,…,wk is a k-dimensional subspace of VN, so step 3.2 gives θk(VN)≤λk(A)+ε. By monotonicity from step 3.1 the same upper bound holds for all n≥N. As ε>0 is arbitrary, the limit in step 3.1 is at most λk(A); combined with its lower bound from step 2.1 it equals λk(A).

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Residual distance and isolated-eigenspace certificate

Statement

Assume the Axiom of Choice and Countable Choice. Let H≠{0} be a complex Hilbert space and let T=T∗ be self-adjoint on H, with spectral projection-valued measure ET. Let u∈D(T) satisfy ∥u∥=1, let λ∈R, and define the residual r=(T−λI)u. For a Borel set Δ⊆R, write PΔ=ET(Δ). If g>0 and ∣x−λ∣≥g for every x∈σ(T)∖Δ, then

dist⁡(λ,σ(T))≤∥r∥,∥(I−PΔ)u∥≤∥r∥g,

where dist⁡(λ,S)=inf⁡x∈S∣x−λ∣. If σ(T)∖Δ=∅, the second conclusion is ∥(I−PΔ)u∥=0.

Facts & Assumptions

Given: Choice and Countable Choice; a nonzero complex Hilbert space H; a self-adjoint operator T with spectral PVM ET; u∈D(T) with ∥u∥=1; a real λ; and a Borel set Δ and gap g as in the Statement.

[A1]

The Axiom of Choice and Countable Choice are the set-theoretic assumptions of the spectral theorem and scalar-measure suppliers (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

[F1]

T=∫x dET(x) with domain D(T)={v:∫x2 dμv(x)<∞}, where ET is a regular PVM (Spectral theorem for unbounded self-adjoint operators (PVM form)).

[F2]

μu(B)=⟨ET(B)u,u⟩ is a positive measure of total mass ∥u∥2=1 (Scalar and complex measures from a pvm).

[F3]

For real Borel functions, the unbounded PVM integral has its squared-integrability domain and norm identity; the Borel calculus identifies σ(T) as the essential range of the identity function, and its proof shows ET(R∖σ(T))=0 (The unbounded PVM integral is densely defined, closed and normal, Unbounded Borel functional calculus: domains, products, spectral mapping).

Proof

1.1A1F1F2F3given

Apply the Borel sum rule (Unbounded Borel functional calculus: domains, products, spectral mapping, Statement, clause 3) to f(x)=x and h(x)=−λ. By [F1], f(T)=T, while h(T)=−λI has domain H; thus u∈D(f(T))∩D(h(T)) and r=(x↦x−λ)(T)u. The norm identity in [F3] therefore gives ∥r∥2=∫R∣x−λ∣2 dμu(x). The measure μu has total mass one by [F2].

2.1F2F3step 1.1algebra

By [F3], μu is supported on σ(T). Set d=dist⁡(λ,σ(T)). For every x∈σ(T), ∣x−λ∣≥d by the definition of infimum, so step 1.1 yields ∥r∥2≥d2μu(σ(T))=d2. Both sides are nonnegative, hence d≤∥r∥.

3.1F2F3step 1.1algebra∎

Since I−PΔ=ET(R∖Δ), the PVM norm identity gives ∥(I−PΔ)u∥2=μu(R∖Δ)=μu(σ(T)∖Δ) by support from [F3]. On this set ∣x−λ∣≥g, so step 1.1 implies ∥r∥2≥g2∥(I−PΔ)u∥2. Taking nonnegative square roots and dividing by g>0 proves the cluster estimate. If σ(T)∖Δ is empty, [F3] directly gives μu(R∖Δ)=0, yielding the stated zero bound.

Remarks

The residual is the continuum quantity (T−λI)u and requires u∈D(T). A raw discrete-matrix residual is not a continuum residual unless its vector and operator action are shown to satisfy these domain hypotheses. The distance estimate locates some spectrum; only the separate gap-and-cluster hypothesis bounds amplitude outside a specified spectral set.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

A posteriori Schrödinger propagation bound

Statement

Assume the Axiom of Choice and Countable Choice. Let H≠{0} be a complex Hilbert space, let T=T∗ be self-adjoint on H, and fix ℏ>0. Let I⊆R be an open interval, let t0∈I, and let v∈C1(I;H) satisfy v(s)∈D(T) for every s∈I and s↦Tv(s) continuous. Define r(s)=iℏv′(s)−Tv(s) and UT(t,t0)=e−i(t−t0)T/ℏ by the Borel functional calculus. Then for every t∈I,

∥v(t)−UT(t,t0)v(t0)∥≤1ℏ∫min⁡(t,t0)max⁡(t,t0)∥r(s)∥ ds.

The integral is the ordinary integral of the continuous real-valued function s↦∥r(s)∥; the bound is conditional on the stated operator-domain regularity and makes no assertion about an asymptotic approximation outside this residual estimate.

Facts & Assumptions

Given: Choice and Countable Choice; a nonzero complex Hilbert space H; a self-adjoint T; ℏ>0; an open interval I; t0,t∈I; and the path v with its domain and continuity properties from the Statement.

[A1]

Choice supplies the unbounded spectral theorem, and Countable Choice is required by the Banach-valued Bochner integral theorem used below (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

[F1]

A self-adjoint T determines the strongly continuous unitary group s↦eisT by the Borel functional calculus; it preserves D(T) and has derivative iTeisTx for x∈D(T) (Stone's theorem: unitary groups and self-adjoint generators, A self-adjoint operator generates a strongly continuous unitary group).

[F2]

The spectral theorem supplies the PVM representation of T, and the Borel functional calculus defines products and the exponential functions of T on their exact domains (Spectral theorem for unbounded self-adjoint operators (PVM form), Unbounded Borel functional calculus: domains, products, spectral mapping).

[F3]

For a Banach space-valued continuously differentiable curve on a compact interval, the Bochner fundamental theorem gives w(b)−w(a)=∫abw′(s) ds; this integral is defined by the Bochner-integrable-function construction (Bochner-integrable function, Fundamental theorem of calculus for Banach-valued continuous curves).

[F4]

The Bochner integral satisfies ∥∫abf(s) ds∥≤∫ab∥f(s)∥ ds for integrable f (Bochner integral norm inequality).

Proof

1.1A1F1F2givenalgebra

Fix s in the compact segment joining t0 to t, put W(τ)=eiτT and U(s)=W((s−t0)/ℏ), and define w(s)=U(s)v(s). For h with s+h in the interval, the group law gives w(s+h)−w(s)h=U(s+h)v(s+h)−v(s)h+U(s)W(h/ℏ)−Ihv(s). By [F1], U is strongly continuous and unitary, the first term tends to U(s)v′(s), and since v(s)∈D(T) the second tends to iℏU(s)Tv(s) by the derivative of W at zero and the scalar chain rule. Thus w is differentiable and w′(s)=U(s)v′(s)+iℏU(s)Tv(s)=−iℏU(s)r(s), after substituting iℏv′=Tv+r. The derivative is continuous because v′, Tv, and hence r are continuous and U is strongly continuous.

2.1F1F3F4step 1.1algebra∎

If t≥t0, apply [F3] on [t0,t]; if t<t0, apply it on [t,t0] and negate the resulting identity. In either case w(t)−w(t0)=−iℏ∫t0tU(s)r(s) ds, using step 1.1. Then [F4] gives ∥w(t)−w(t0)∥≤1ℏ∫min⁡(t,t0)max⁡(t,t0)∥U(s)r(s)∥ ds=1ℏ∫min⁡(t,t0)max⁡(t,t0)∥r(s)∥ ds; the equality uses unitarity of U(s). Since w(t0)=v(t0) and w(t)=UT(t,t0)∗v(t), unitarity also gives ∥w(t)−w(t0)∥=∥v(t)−UT(t,t0)v(t0)∥. This is the required estimate, including t=t0 and either time orientation.

Remarks

The estimate is an exact bound in terms of the actual residual r(s) and the stated operator-domain regularity. Writing down an asymptotic ansatz or a discrete time step does not bound this continuum residual; no WKB or discretization error claim is made here.

5 · Examples, experiments and counterexamples

None yet.

Sources