Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)verified 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 Finite Vertex Coupling And Net Index

Physical scope

Pure mathematical finite-dimensional examples conditional on the operator lemma; no physical membrane states or vacua are asserted.

Statement

Let D be any closed densely defined Fredholm branch operator as in F4 Closed Branch Vertex Supercharge Index. If E=V=C and S=T=0, M(e)=me, then for m≠0 the vertex pair has no even or odd zero state, while for m=0 it has one even and one odd zero state. In both cases ind⁡L=ind⁡D. If instead E=0, V=C, and T=0, then ind⁡L=ind⁡D−1 and an odd cokernel state remains. These are mathematical examples, not membrane vacua.

Facts & Assumptions

Given: A closed densely defined Fredholm operator D and the finite vertex spaces and maps specified in the Statement.

[F1]

For the operator L(x,e)=(Dx+Se,Tx+Me) with finite-dimensional E,V and graph-bounded T, the closed-branch vertex lemma states ind⁡L=ind⁡D+dim⁡E−dim⁡V (F4 Closed Branch Vertex Supercharge Index).

Proof

Given: The hypotheses and maps in the Statement.

1.1givenF1algebra

When E=V=C and S=T=0, the operator is the direct sum D⊕m. If m≠0, scalar multiplication by m is bijective, so the vertex kernel and cokernel both vanish. If m=0, its kernel and cokernel are each C. The two zero spaces of the odd operator therefore contain respectively one even and one odd vertex state in the zero case, and none in the nonzero case. Formula [F1] gives ind⁡L=ind⁡D+1−1=ind⁡D in both cases.

2.1givenF1step 1.1algebra∎

If E=0, V=C, and T=0, then Lx=(Dx,0). Its kernel is ker⁡D, its range is ran⁡D⊕{0}, and its cokernel is (H−/ran⁡D)⊕C. The range is closed because ran⁡D is closed. Thus its index is ind⁡D−1, also as [F1] gives. The additional odd cokernel copy of C is present regardless of any physical interpretation.

Depends on

Dependency tree · 2 levels