Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-11-04 (gpt-6.1-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.

F4 Closed Branch Vertex Supercharge Index

Physical scope

Pure operator theorem; physical application requires actual realization data and transfer-domain identification.

Statement

Assume Countable Choice and Dependent Choice. Let H+ and H− be complex Hilbert spaces, and let D:Dom⁡(D)⊂H+→H− be densely defined and closed. Give X:=Dom⁡(D) the graph inner product ⟨x,y⟩D=⟨x,y⟩H++⟨Dx,Dy⟩H−. Write D~:X→H− for x↦Dx on this graph Hilbert space. Throughout this statement, “D is Fredholm” means that D~ has closed range, finite-dimensional kernel and finite-dimensional algebraic cokernel H−/ran⁡D; its index is ind⁡D=dim⁡ker⁡D−dim⁡(H−/ran⁡D). Assume that D is Fredholm in this graph-domain sense. For each Fredholm graph-domain map A:XA→YA below, use the same convention ind⁡A=dim⁡ker⁡A−dim⁡(YA/ran⁡A), in particular for L. Let E,V be finite-dimensional complex Hilbert spaces, S:E→H− and M:E→V bounded linear maps, and T:X→V bounded. Put L(x,e)=(Dx+Se,Tx+Me),Dom⁡(L)=Dom⁡(D)⊕E. The source and target Hilbert spaces for L are Heven:=H+⊕E and Hodd:=H−⊕V. For these choices Dom⁡(L) is dense in Heven, since Dom⁡(D) is dense in H+ and all of E is included. For this possibly unbounded L, “Fredholm” means that the bounded map from its graph-norm domain (Dom⁡(L), ∥(x,e)∥L2=∥(x,e)∥Heven2+∥L(x,e)∥Hodd2)⟶Hodd has closed range, finite-dimensional kernel and finite-dimensional algebraic cokernel. Then L is closed Fredholm and ind⁡L=ind⁡D+dim⁡E−dim⁡V.

Use the orthogonal direct sum H:=Heven⊕Hodd with grading operator Γ(u,v)=(u,−v). For a densely defined operator L:Heven→Hodd, its cross-Hilbert adjoint L∗:Dom⁡(L∗)⊂Hodd→Heven is characterized by y∈Dom⁡(L∗), L∗y=z⟺⟨Lx,y⟩Hodd=⟨x,z⟩Hevenfor every x∈Dom⁡(L). The vector z, when it exists, is unique because Dom⁡(L) is dense in Heven. Define Q:Dom⁡(L)⊕Dom⁡(L∗)⊂H→H by Q(u,v)=(L∗v,Lu). Then Q is odd (QΓ=−ΓQ on its domain) and self-adjoint (equality with its Hilbert-space adjoint, including equality of domains). Its even and odd zero spaces are respectively ker⁡L and ker⁡L∗, whose dimension difference is ind⁡L. For finitely many supplied local sectors, the corrections dim⁡E−dim⁡V add. These are operator assertions only; they assign no physical meaning to the maps and assert no singular membrane or regulator exists.

Facts & Assumptions

Given: The hypotheses and objects in the Statement. Inner products are linear in their first variable. A Fredholm operator has closed range and finite-dimensional kernel and cokernel, and its index is kernel dimension minus cokernel dimension.

[F1]

A closed operator's graph domain is a Hilbert space in its graph norm (Densely defined, closed and closable operators, and cores).

[F2]

A bounded bijective linear map between Banach spaces has bounded inverse under Dependent Choice (Bounded inverse theorem).

[F3]

Under Countable Choice, a closed subspace M of a Hilbert space H satisfies H=M⊕M⊥ (Orthogonal decomposition by a closed subspace).

[F4]

For densely defined A, the adjoint satisfies ⟨Ax,y⟩=⟨x,A∗y⟩ on the respective domains (Adjoint of a densely defined operator).

[F5]

For Fredholm A, ind⁡A=dim⁡ker⁡A−dim⁡coker⁡A (Fredholm operator cokernel and index).

[F6]

A finite-dimensional normed subspace with a finite ordered basis is closed (A finite-dimensional normed subspace is closed).

[L1]

Bühler and Salamon, Functional Analysis, Definition 6.26 and Lemma 6.27(i)–(iv), printed pp. 323–324, formulate the adjoint for a densely defined operator A:Dom⁡(A)⊂X→Y between possibly distinct complex Hilbert spaces and state that a closed A satisfies Dom⁡(A∗) dense and A∗∗=A. Lemma 6.27 leaves its proof details to the reader; the cross-space graph argument needed here is given in step 4.1.

Proof

Given: The hypotheses and objects in the Statement.

1.1givenF1construct

The domain is dense since Dom⁡(D) is dense. Suppose (xn,en)→(x,e) in H+⊕E and L(xn,en)→(y,z) in H−⊕V. Boundedness of S gives Dxn=pr⁡H−L(xn,en)−Sen→y−Se. Closedness of D then gives x∈Dom⁡(D) and Dx=y−Se. Thus xn→x in the graph norm. Boundedness of T and M gives Txn+Men→Tx+Me=z. So L(x,e)=(y,z) and L is closed. On the graph Hilbert space X⊕E, L is bounded. Its graph norm is equivalent to the product graph norm: boundedness gives ∥(x,e)∥L≤C0(∥x∥D2+∥e∥2)1/2 for some C0, while ∥e∥≤∥(x,e)∥L and ∥Dx∥≤∥pr⁡H−L(x,e)∥+∥S∥∥e∥≤(1+∥S∥)∥(x,e)∥L give the reverse bound. Thus the block argument below computes Fredholmness and index on the graph-norm domain in the Statement.

2.1givenA1F1F2F3F5F6step 1.1construct

In X, let K=ker⁡D, R=ran⁡D, and X1=K⊥. By the assumed Fredholmness of D and [F5], K is finite and R is closed of finite codimension. By [F3], X=K⊕X1 and H−=R⊕C0, where C0=R⊥ is finite. The map D∣X1:X1→R is a bounded bijection: its kernel is zero, and if Dx=y∈R, decomposing x=k+x1 gives Dx1=y. Both spaces are Banach, so [F2] gives a bounded inverse. Let PR be the orthogonal projection and W=span⁡(PRS(E)). A basis of the finite dimensional E gives a finite spanning list for W; deleting dependent vectors leaves a finite ordered basis (the empty basis if W=0). Thus [F6] makes W closed. By [F3], R=W⊕R1, with R1=R∩W⊥. Applying the bounded isomorphism D∣X1 gives X1=D−1W⊕D−1R1; the first summand is finite-dimensional and both are closed because the isomorphism and its inverse are bounded.

3.1F2F3F5step 2.1constructalgebra

Decompose the source as Xf⊕D−1R1, where Xf=K⊕D−1W⊕E, and the target as Yf⊕R1, where Yf=W⊕C0⊕V. In these coordinates L=(AB0J), where J=D∣D−1R1 is a bounded isomorphism. The lower-left block vanishes because D(K)=0, D(D−1W)=W, and PRS(E)⊂W. The upper-right block is the bounded map T∣D−1R1. The bounded invertible target change (yf,y1)↦(yf−BJ−1y1,y1) conjugates this operator to A⊕J. The finite-dimensional map A:Xf→Yf has closed range and index dim⁡Xf−dim⁡Yf by rank-nullity, while J has index zero. Therefore L is Fredholm, and ind⁡L=(dim⁡K−dim⁡C0)+dim⁡E−dim⁡V=ind⁡D+dim⁡E−dim⁡V; the first equality uses H−/R≅C0.

4.1A1F3F4F5L1step 1.1step 3.1construct

Write Γ(L)={(x,Lx):x∈Dom⁡(L)}⊂Heven⊕Hodd and define the unitary U:Hodd⊕Heven→Heven⊕Hodd by U(y,z)=(−z,y). By the cross-space adjoint definition in the Statement, UΓ(L∗)=Γ(L)⊥: indeed, (y,L∗y) is sent to (−L∗y,y), which is perpendicular to every (x,Lx) by the adjoint identity; conversely, if (−z,y)∈Γ(L)⊥, that orthogonality is exactly ⟨Lx,y⟩=⟨x,z⟩ for every x∈Dom⁡(L), so y∈Dom⁡(L∗) and z=L∗y. If w∈Hodd is perpendicular to Dom⁡(L∗), then ⟨(0,w),(−L∗y,y)⟩=0 for every y∈Dom⁡(L∗); the identity just proved gives (0,w)∈Γ(L)⊥⊥=Γ(L), since L is closed and [F3] applies. A graph contains only one output over each input, so (0,w)=(0,L0)=(0,0) and w=0. Thus Dom⁡(L∗) is dense in Hodd. Apply the same graph identity to L∗, using U′:Heven⊕Hodd→Hodd⊕Heven, U′(x,z)=(−z,x). Since Dom⁡(L∗) is dense, L∗∗ is defined, and Γ(L∗∗)=U′−1Γ(L∗)⊥=U′−1U−1Γ(L)=−Γ(L)=Γ(L). Here Γ(L) is closed, and the middle equality uses U′−1U−1(x,y)=(−x,−y); a linear subspace equals its negative. Hence L∗∗=L as operators with equal domains. The domain of Q is dense because Dom⁡(L) is dense by step 1.1 and Dom⁡(L∗) was just shown dense, so Q∗ is defined. For Q∗(a,b)=(c,d), the adjoint identity is ⟨L∗y,a⟩Heven+⟨Lx,b⟩Hodd=⟨x,c⟩Heven+⟨y,d⟩Hodd for every x∈Dom⁡(L) and y∈Dom⁡(L∗). Taking x=0 and then y=0, the cross-space adjoint definition and L∗∗=L give respectively a∈Dom⁡(L), d=La, and b∈Dom⁡(L∗), c=L∗b. Conversely these conditions make the identity hold, so Dom⁡(Q∗)=Dom⁡(L)⊕Dom⁡(L∗) and Q∗=Q. The grading is odd by the block formula. The even and odd zero spaces are ker⁡L and ker⁡L∗; the latter is (ran⁡L)⊥, which has dimension dim⁡(Hodd/ran⁡L) because ran⁡L is closed. Their signed dimension is ind⁡L.

5.1step 3.1algebra∎

For finitely many supplied local sectors set E=⨁pEp and V=⨁pVp. Finite-dimensionality gives dim⁡E−dim⁡V=∑p(dim⁡Ep−dim⁡Vp), so the index corrections add. This bookkeeping does not assert an actual singular transfer is finite dimensional or that a physical Fredholm regulator exists.

Depends on

Dependency tree · 2 levels

Sources