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

Common-domain nonautonomous evolution

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H be a complex Hilbert space, let Y be a dense linear subspace of H that is itself a Hilbert space continuously embedded in H (for instance Y=D(A0) with the graph norm of a self-adjoint A0), let T>0, and let A(t) for t∈[0,T] be an operator with D(A(t))=Y, self-adjoint as an operator on H, such that t↦A(t) belongs to C1([0,T];B(Y,H)) (A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum, Symmetric, self-adjoint and essentially self-adjoint operators). Put L:=sup⁡t∥A′(t)∥B(Y,H). Then:

(a) Existence and uniqueness of a strong propagator. There is a family U(t,s), 0≤s≤t≤T, of unitary operators on H with: U(s,s)=I; U(t,s)U(s,r)=U(t,r); (t,s)↦U(t,s)ξ continuous on {s≤t} for each ξ∈H; U(t,s)Y=Y with ∥U(t,s)y∥Y≤CT∥y∥Y for a constant CT independent of (s,t)∈[0,T]2; and for every y∈Y the map t↦U(t,s)y is C1 in H with i ∂tU(t,s)y=A(t)U(t,s)y,s≤t≤T.

(b) Uniqueness. If V(t,s) is another family of bounded linear operators on H with the same strong equation on Y, V(s,s)=I and sup⁡r∥V(r,s)y∥H<∞, then V=U.

(c) Equations for the reverse and adjoint. U(t,s)Y=Y for all 0≤s≤t≤T and U(s,t):=U(t,s)−1 satisfies i∂sU(s,t)y=A(s)U(s,t)y for y∈Y; U(t,s)∗=U(s,t). Equivalently, differentiating the second argument of the forward propagator gives i∂sU(t,s)y=−U(t,s)A(s)y. The domain maps are jointly strongly continuous in Y.

The theorem is stated for the abstract family A; a physical generator is obtained by A=Henergy/ℏ after choosing a time unit.

Facts & Assumptions

Given: CC, H,Y,A,T as above. Inner products are linear in the first argument. Strong integrals of continuous Hilbert-valued curves are their norm limits of Riemann sums; uniform continuity gives existence, and the elementary fundamental theorem of calculus holds for them (Fundamental theorem of calculus for Banach-valued continuous curves).

[F1]

The actual CC self-adjoint resolvent estimate Resolvent of a self-adjoint operator: nonreal resolvents and the estimate gives Rz=(A−z)−1∈B(H), ∥Rz∥≤∣Im⁡z∣−1, its exact range D(A), adjoint Rz∗=Rz‾, and commuting resolvents. A self-adjoint operator is closed. The CC orthogonal projection theorem Orthogonal decomposition by a closed subspace is available; it gives Riesz representation for bounded functionals by projecting onto their closed kernels. No Stone theorem, Banach open mapping theorem, or arbitrary Hilbert basis is used.

Proof

1.1givenF1constructalgebra

[A CC Hilbert inverse lemma] A bounded bijection C:E→F between Hilbert spaces has bounded inverse under CC, as follows. The image Fn=C{x:∥x∥≤n} is closed: if Cxj→z, choose the unique preimages xj with ∥xj∥≤n. In the closed span of this specified countable sequence, Gram-Schmidt applied in order to xj gives a finite or countable ONB. Successive canonical subsequences make all its scalar coordinates converge (bisect bounded real and imaginary coordinate ranges, retain the first half containing infinitely many indices, then use least indices and take the diagonal). Bessel's inequality gives a vector x of norm at most n with those coordinates. Finite-coordinate approximation and the uniform norm bound show xj along this subsequence converges weakly to x against every vector of the span; orthogonal projection gives weak convergence against every vector of E. Testing Cxj against each fixed vector of F shows Cx=z. Hence Fn is closed, convex and symmetric, and F=⋃nFn. If no Fn contains a neighborhood of zero, CC chooses znm∈F∖Fn with ∥znm∥<1/m. The closed span F0 of this countable family has a specified countable dense list of rational-complex finite combinations. Each Fn∩F0 has empty interior in F0: otherwise its convexity and symmetry would imply a ball about zero lies in it, contradicting znm→0. The Baire contradiction on this specified separable complete space needs no DC: given closed sets with empty interior, construct nested closed balls of radii at most 2−j, with each contained in the previous ball's interior and avoiding the jth closed set, by taking the first eligible center in the fixed dense list and the first eligible positive rational radius. The centers are Cauchy and completeness supplies a point avoiding every closed set. This contradicts F0=⋃n(Fn∩F0). Thus some Fn contains a ball of radius r>0 about zero; scaling gives ∥C−1z∥≤2n∥z∥/r. All subsequences, dense lists and nested-ball recursions above are uniquely specified; only the countable family znm requires CC.

1.2F1constructalgebra

[Resolvent autonomous groups on arbitrary H] For a fixed self-adjoint A, let Jn=n2RinR−in and An=AJn=(n2/2)(Rin+R−in). Resolvent algebra gives Jn=(n/(2i))(Rin−R−in), ∥Jn∥≤1, and bounded self-adjoint An with ∥An∥≤n. They and their bounded power-series exponentials commute with one another. For y∈D(A), (I−Jn)y=12(Rin+R−in)Ay, so ∥(I−Jn)y∥≤∥Ay∥/n. Density and ∥Jn∥≤1 give Jn→I strongly on all H; on D(A), Any=JnAy→Ay. Define En(t)=exp⁡(−itAn) by its norm-convergent series. Differentiation of that series, self-adjointness and the group law prove unitarity. The bounded Duhamel formula and commutation give ∥(En(t)−Em(t))y∥≤∣t∣∥(An−Am)y∥, uniformly on bounded t intervals. Therefore En(t) has a strong limit E(t) uniformly on bounded intervals, first on D(A) and then on all H. The opposite-time limits and products give E(t)E(−t)=I; limits preserve norms, so it is a strongly continuous unitary group. Resolvent commutation shows En(t)D(A)⊂D(A) and AEn(t)y=En(t)Ay (use graph-norm convergence of the power series). Closedness of A then gives E(t)y∈D(A) and AE(t)y=E(t)Ay. Passing through the integral identity for En gives E(t)y=y−i∫0tE(r)Ay dr, hence E′(t)y=−iAE(t)y. In the norm ∥(A−i)y∥, this group is isometric and strongly continuous. No separability of H or spectral-measure selection was used.

2.1step 1.1F1constructalgebra

[Uniform moving graph equivalence] Put K(t)=A(t)−i:Y→H. It is a bounded bijection by [F1], so step 1.1 gives K(t)−1∈B(H,Y). Around a fixed s, K(t)−1=K(s)−1[I+(K(t)−K(s))K(s)−1]−1 whenever ∥K(t)−K(s)∥Y→H∥K(s)−1∥H→Y<1. The Neumann series and its differentiated inverse identity prove K−1∈C1([0,T];B(H,Y)), with (K−1)′=−K−1K′K−1. Finite covering of the compact time interval gives M=sup⁡t∥K(t)−1∥H→Y<∞ and N=sup⁡t∥K(t)∥Y→H<∞. Let L=sup⁡t∥K′(t)∥Y→H. Then ∥K(t)K(s)−1−I∥H→H≤LM∣t−s∣. Thus the given Y norm and every moving graph norm ∥K(t)y∥H are uniformly equivalent. The function B(t)=K′(t)K(t)−1 is norm-continuous on H, with norm at most LM.

3.1step 1.2step 2.1constructalgebra

[Frozen products with their true graph bounds] Use the prescribed uniform partitions of mesh hn=T/n, with left-endpoint function τn(r)=hn⌊r/hn⌋ (including τn(T)=T) and frozen generator Anfr(r)=A(τn(r)). Distinguish this notation from step 1.2's autonomous approximants. Define Un(t,s) by the finite time-ordered product of step 1.2's exact autonomous groups, for any orientation of s,t. Each factor preserves Y and is isometric for the graph norm at its own frozen time. Between successive factors insert K(tj+1)K(tj)−1; step 2.1 bounds their product by ∏j(1+LMhn)≤eLMT. Endpoint graph conversions use the same estimate. Hence, for all n,s,t, ∥Un(t,s)y∥Y≤CT∥y∥Y, for example CT=MNeLMT, enlarged if necessary for endpoints. Between grid points the products satisfy both endpoint equations with Anfr. Differentiating Un(t,r)Um(r,s)y is legitimate because every factor preserves Y and has the autonomous strong derivative there. Integration over the combined finite partition gives ∥(Un(t,s)−Um(t,s))y∥H≤CTLT(hn+hm)∥y∥Y. This proves strong convergence uniformly in (t,s) on Y, and density and unitarity extend it to each fixed H vector. Write the limit U(t,s). Norm preservation, opposite-orientation products, cocycles and joint continuity pass to the strong limit, yielding unitary inverses and a joint strongly continuous H evolution. No Y membership has yet been inferred from this limit.

4.1step 2.1step 3.1constructalgebra

[The bounded graph-coordinate evolution] For fixed s and g0∈H, solve g(t)=U(t,s)g0+∫stU(t,r)B(r)g(r) dr on s≤t≤T. Iterating this integral produces norm-continuous functions; the jth term has norm at most ∥g0∥(∥B∥∞∣t−s∣)j/j!. Uniform summability supplies a continuous solution and repeated integral estimation proves uniqueness. It also gives ∥g(t)∥≤e∥B∥∞T∥g0∥. Joint continuity of U and uniform series convergence give joint continuity of this solution in (t,s) for fixed g0. These are bounded Hilbert-space Volterra operations. They do not assume that the resulting g belongs to D(A(t)) or solves an unbounded strong equation.

5.1step 2.1step 3.1step 4.1constructalgebra

[Convergence of the actual graph coordinates] Fix y∈Y. Define gn(t)=K(τn(t))Un(t,s)y, using the right value at grid points, and gn(tj−) using the preceding frozen time. On each open frozen interval, commutation with its K gives the exact autonomous evolution of gn. At a grid point the jump is gn(tj)=Jnjgn(tj−), where Jnj=K(tj)K(tj−1)−1 and Jnj−I=∫tj−1tjK′(r)K(tj−1)−1dr. Successive insertion of these jumps gives the exact finite formula gn(t)=Un(t,s)K(τn(s))y+∑s<tj≤tUn(t,tj)(Jnj−I)gn(tj−). The first incomplete interval produces no jump until its right end; assigning the full preceding-cell jump at that end adds an interval of length at most hn to a quadrature compared with [s,t], whose bounded contribution tends to zero. Uniform continuity of K′ and K−1 gives ∥(Jnj−I)−hnB(tj)∥≤hnϵn, with ϵn→0, and ∥Jnj−I∥≤LMhn. Let g be step 4.1's solution with g0=K(s)y. Replace the sum's gn(tj−) by g(tj); the resulting expression converges uniformly in s≤t≤T to the Volterra expression for g(t). To justify this assertion, Un→U uniformly on every compact set of input vectors: a finite norm-net and the uniform norm-one bound reduce this to step 3.1's fixed-vector convergence. Apply it to the compact image of the continuous curve B(r)g(r), then use joint continuity of U(t,r)B(r)g(r) on the compact triangle for its uniform Riemann-sum convergence. The displayed jump error sums to at most Tϵnsup⁡r∥g(r)∥, and the initial term converges uniformly. Denote the total consistency error by an→0. The exact jump formula therefore bounds every right or left value error by an+LMhn∑s<tj≤t∥gn(tj−)−g(tj)∥, with the current endpoint omitted for a left value. Induction over nodes gives the discrete Gronwall bound sup⁡t∥gn(t)−g(t)∥, including left values, at most an∏j(1+LMhn)≤aneLMT. Thus the graph coordinates converge uniformly in H.

6.1step 2.1step 3.1step 5.1algebra

[Domain membership by uniform Y convergence] Since K(τn(t))−1→K(t)−1 uniformly in B(H,Y), step 5.1 gives Un(t,s)y=K(τn(t))−1gn(t)→ψ(t):=K(t)−1g(t) uniformly in Y. The continuous embedding identifies this limit with step 3.1's H limit, so U(t,s)y=ψ(t)∈Y. The same convergence passes the bound CT∥y∥Y to the limit, and the formula gives strong Y continuity in t. Repeating the construction with A(T−r) and the generator sign reversed handles backward orientation and proves U(s,t)Y⊂Y. Since these operators are inverses on H, U(t,s)Y=Y. Joint Y continuity follows from the cocycle, continuity at each diagonal and the uniform Y bound: continuity of U(t,s)y in both endpoints reduces to strong continuity of U(t,t0) and U(s0,s) on each fixed vector of Y.

7.1step 3.1step 6.1algebra∎

[The strong equations and uniqueness] On Y the frozen products obey Un(t,s)y=y−i∫stA(τn(r))Un(r,s)y dr. By step 6.1 their vectors converge uniformly in Y, and A(τn(r))→A(r) uniformly in B(Y,H). Therefore the integrands converge uniformly in H to the continuous curve A(r)U(r,s)y. Passing to the integral gives the asserted strong C1(H) first-endpoint equation. A difference of two strong common-domain solutions has constant squared norm, since 2Re⁡⟨−iA(t)η(t),η(t)⟩=0; zero initial value gives uniqueness on Y, and boundedness and density give operator equality on H. For the second endpoint use the cocycle U(t,s+h)y−U(t,s)y=U(t,s+h)[y−U(s+h,s)y]. The diagonal first-endpoint derivative, joint strong continuity and boundedness give ∂sU(t,s)y=iU(t,s)A(s)y. Its derivative is continuous in H because A(s)y is continuous and U jointly strongly continuous. Differentiating the inverse with s as its first endpoint gives i∂sU(s,t)y=A(s)U(s,t)y, while unitarity gives U(t,s)∗=U(s,t). This proves the corrected full contract.

Depends on

Dependency tree · 2 levels

Sources