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
Pure operator theorem; physical application requires actual realization data and transfer-domain identification.
Statement
Assume Countable Choice and Dependent Choice. Let and be complex Hilbert spaces, and let be densely defined and closed. Give the graph inner product . Write for on this graph Hilbert space. Throughout this statement, “ is Fredholm” means that has closed range, finite-dimensional kernel and finite-dimensional algebraic cokernel ; its index is . Assume that is Fredholm in this graph-domain sense. For each Fredholm graph-domain map below, use the same convention , in particular for . Let be finite-dimensional complex Hilbert spaces, and bounded linear maps, and bounded. Put The source and target Hilbert spaces for are and . For these choices is dense in , since is dense in and all of is included. For this possibly unbounded , “Fredholm” means that the bounded map from its graph-norm domain has closed range, finite-dimensional kernel and finite-dimensional algebraic cokernel. Then is closed Fredholm and
Use the orthogonal direct sum with grading operator . For a densely defined operator , its cross-Hilbert adjoint is characterized by The vector , when it exists, is unique because is dense in . Define by . Then is odd ( on its domain) and self-adjoint (equality with its Hilbert-space adjoint, including equality of domains). Its even and odd zero spaces are respectively and , whose dimension difference is . For finitely many supplied local sectors, the corrections 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.
Countable Choice and Dependent Choice are assumed (The Axiom of Countable Choice (), The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain).
A closed operator's graph domain is a Hilbert space in its graph norm (Densely defined, closed and closable operators, and cores).
A bounded bijective linear map between Banach spaces has bounded inverse under Dependent Choice (Bounded inverse theorem).
Under Countable Choice, a closed subspace of a Hilbert space satisfies (Orthogonal decomposition by a closed subspace).
For densely defined , the adjoint satisfies on the respective domains (Adjoint of a densely defined operator).
For Fredholm , (Fredholm operator cokernel and index).
A finite-dimensional normed subspace with a finite ordered basis is closed (A finite-dimensional normed subspace is closed).
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 between possibly distinct complex Hilbert spaces and state that a closed satisfies dense and . 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.
The domain is dense since is dense. Suppose in and in . Boundedness of gives . Closedness of then gives and . Thus in the graph norm. Boundedness of and gives . So and is closed. On the graph Hilbert space , is bounded. Its graph norm is equivalent to the product graph norm: boundedness gives for some , while and give the reverse bound. Thus the block argument below computes Fredholmness and index on the graph-norm domain in the Statement.
In , let , , and . By the assumed Fredholmness of and [F5], is finite and is closed of finite codimension. By [F3], and , where is finite. The map is a bounded bijection: its kernel is zero, and if , decomposing gives . Both spaces are Banach, so [F2] gives a bounded inverse. Let be the orthogonal projection and . A basis of the finite dimensional gives a finite spanning list for ; deleting dependent vectors leaves a finite ordered basis (the empty basis if ). Thus [F6] makes closed. By [F3], , with . Applying the bounded isomorphism gives ; the first summand is finite-dimensional and both are closed because the isomorphism and its inverse are bounded.
Decompose the source as , where , and the target as , where . In these coordinates , where is a bounded isomorphism. The lower-left block vanishes because , , and . The upper-right block is the bounded map . The bounded invertible target change conjugates this operator to . The finite-dimensional map has closed range and index by rank-nullity, while has index zero. Therefore is Fredholm, and ; the first equality uses .
Write and define the unitary by . By the cross-space adjoint definition in the Statement, : indeed, is sent to , which is perpendicular to every by the adjoint identity; conversely, if , that orthogonality is exactly for every , so and . If is perpendicular to , then for every ; the identity just proved gives , since is closed and [F3] applies. A graph contains only one output over each input, so and . Thus is dense in . Apply the same graph identity to , using , . Since is dense, is defined, and . Here is closed, and the middle equality uses ; a linear subspace equals its negative. Hence as operators with equal domains. The domain of is dense because is dense by step 1.1 and was just shown dense, so is defined. For , the adjoint identity is for every and . Taking and then , the cross-space adjoint definition and give respectively , , and , . Conversely these conditions make the identity hold, so and . The grading is odd by the block formula. The even and odd zero spaces are and ; the latter is , which has dimension because is closed. Their signed dimension is .
For finitely many supplied local sectors set and . Finite-dimensionality gives , 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
The Axiom of Countable Choice ()
The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain
Densely defined, closed and closable operators, and cores
Adjoint of a densely defined operator
Fredholm operator cokernel and index
A finite-dimensional normed subspace is closed
Bounded inverse theorem
Orthogonal decomposition by a closed subspace