Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-09-24 (gpt-6-sol)
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.

Fredholm index and range of an asymptotically hyperbolic first-order operator

Statement

Let A:R→Md(R) be continuous with limits A± as t→±∞. Suppose each limit is self-adjoint for some positive-definite inner product and has no zero eigenvalue. Put DA:C01(R,Rd)→C00(R,Rd),DAu=u′−A(t)u. Let E−u be the initial values at 0 of homogeneous solutions decaying as t→−∞, and let E+s be the corresponding values for solutions decaying as t→+∞. Then DA is bounded Fredholm, ker⁡DA≅E−u∩E+s,coker⁡DA≅Rd/(E−u+E+s), and ind⁡DA=dim⁡Eu(A−)−dim⁡Eu(A+), where Eu(A±) denotes the positive eigenspace of the limiting matrix. In particular DA is onto exactly when E−u+E+s=Rd. The isomorphism for the cokernel is induced by the half-line right inverses constructed in the proof; no canonical identification with a tangent quotient is asserted.

Facts & Assumptions

Given: The matrix path, limits, and function spaces in the statement.

[F1]

On each half-line the restricted operator has a bounded right inverse, the decaying homogeneous initial-value space has the indicated spectral dimension, and right-inverse values of forcings vanishing at 0 span modulo that space (A half-line first-order operator with a hyperbolic limit has a right inverse).

[F2]

Homogeneous linear matrix equations have unique solutions on finite intervals (Linear matrix ODEs have unique global solutions on a fixed interval).

Proof

technique · direct
1.1

The convergence of A(t) at both ends makes it bounded, so DA is a bounded map from the indicated supremum C1 norm to the supremum C0 norm. Apply [F1] to A∣[0,∞) and, after time reversal, to A∣(−∞,0]. Denote the bounded right inverses by R+,R−. The two homogeneous initial-value spaces are E+s,E−u, with dim⁡E+s=d−dim⁡Eu(A+) and dim⁡E−u=dim⁡Eu(A−).

F1given
2.1

A homogeneous whole-line solution is determined by its value at zero by [F2] and belongs to C01 exactly when that value lies in both E−u and E+s. These spaces are finite-dimensional, hence closed, and the evaluation map gives ker⁡DA≅E−u∩E+s.

F2step 1.1algebra
2.2

For v∈C00(R,Rd), write v± for its half-line restrictions and define the bounded linear map T(v)=[R+v+(0)−R−v−(0)]∈Rd/(E−u+E+s). Every decaying solution on the positive half-line has the form R+v++u+, with u+(0)∈E+s; the analogous form on the negative half-line has u−(0)∈E−u. The two half-line solutions can be matched at zero exactly when T(v)=0. When matched, their first derivatives also agree there because each satisfies u′=Au+v and v is continuous. Thus ran⁡DA=ker⁡T, which is closed.

F1F2step 1.1algebra
3.1

The map T is onto. By [F1], E+s together with {R+w(0):w(0)=0} spans Rd. Extend any such w by zero to the negative half-line; the extension is continuous at zero, belongs to C00(R), and has R−v−(0)=0. Its T-images therefore span the quotient by E−u+E+s. Consequently C00/ran⁡DA≅Rd/(E−u+E+s), a finite-dimensional space.

F1step 2.2algebra
4.1

Set a=dim⁡E−u, b=dim⁡E+s, and c=dim⁡(E−u∩E+s). Steps 2.1 and 3.1 give dim⁡ker⁡DA=c and codim⁡ran⁡DA=d−(a+b−c). Hence DA is Fredholm and ind⁡DA=c−[d−a−b+c]=a+b−d=dim⁡Eu(A−)−dim⁡Eu(A+) by step 1.1. The quotient in step 3.1 vanishes exactly when the two initial-value spaces span Rd.

step 1.1step 2.1step 3.1algebra∎

Depends on

Used by

Dependency tree · two levels

10 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources