Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pendingjudge pass (gpt-6-luna)
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.

Real and complex ADHM quotients at positive and regular zero FI

Statement

Assume AC. Fix N≥1, k≥0, standard Hermitian V=Ck, W=CN and ADHM data x=(B1,B2,I,J) with the complex equation [B1,B2]+IJ=0. Stability means that the B1,B2 words applied to I(W) span V; costability means no nonzero common invariant subspace of V lies in ker⁡J; regular means both. Set

μR(x)=[B1,B1†]+[B2,B2†]+II†−J†J.

For every ζ>0, each stable GL(V) orbit meets μR=ζIV in exactly one U(V) orbit, and the inclusion induces a diffeomorphism of smooth real manifolds

{μC=0, μR=ζIV, stable}/U(V) ≅ Xs/GL(V).

At ζ=0, every stable datum satisfying the real equation is automatically costable. Each regular complex orbit meets the zero real level in exactly one unitary orbit, giving instead

{μC=0, μR=0, stable}/U(V) ≅ Xreg/GL(V).

Both identifications are equivariant for the compact rotation/framing torus in the raw-data convention. For k=0 all spaces are points. This theorem identifies the stated finite-dimensional quotients; it asserts no correspondence with sheaves or ASD connections, and no identification of the entire positive-FI quotient with the zero-FI regular locus.

Facts & Assumptions

Given: AC, the specified finite-dimensional spaces, equations, stability and gauge actions. The Axiom of Choice

[F1]

The raw moment maps, regularity and torus conventions are exactly as defined; in particular the real moment uses +II†−J†J. ADHM linear data, stability, costability and FI levels

[F2]

Stable word frames of length at most k−1 cover Xs; the complex gauge action is free and proper and its quotient has smooth holomorphic word-frame charts. Stable ADHM quotient charts, properness and torus lifts

[F4]

Normal complex matrices have orthonormal eigenbases; Hermitian eigenvalues are real, by taking the inner product of an eigenvector with its image. Finite matrix exponential series converge with their differential identities. Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely, Finite matrix exponential series and its identities

[F5]

The finite real implicit-function theorem gives a local Cr solution when the derivative in the unknown block is invertible. The parametrized implicit function theorem with Ck regularity

[F6]

Free proper actions have smooth manifold quotients with submersive quotient maps; submersions have local smooth sections by the constant-rank normal form. Free proper action quotient manifold, The constant-rank theorem for manifolds

[F7]

For A=P+iQ∈Mk(C), with P,Q∈Mk(R), define its realification by ρ(A)=(P−QQP)∈M2k(R). This is an injective real-linear map satisfying ρ(AB)=ρ(A)ρ(B) and ρ(I)=I. Define eA=∑m≥0Am/m! for complex matrices. The real-matrix exponential supplier Finite matrix exponential series and its identities applied to ρ(A), together with these identities and continuity of ρ−1 on its image, gives convergence of this series, ρ(etA)=etρ(A) for real t, and ddtetA=AetA=etAA. The map A↦eA is smooth in the real matrix entries: on a bounded set of realified matrices with norm at most R, an order-s derivative of the degree-m term is bounded by a constant times msRm−s/m! for m≥s and is zero for m<s; these bounds are summable for every fixed s.

Proof

Given: A fixed stable datum x, and k>0 until the final step. Every norm below is Frobenius unless explicitly an operator norm.

1.1F1F2algebra

For g∈GL(V) put x′=g⋅x and M(g)2=∑i∥Bi′∥2+∥I′∥2+∥J′∥2. A fixed word frame C(x) exists by [F2]. Each column of gC(x)=C(x′) is a product of at most k−1 matrices Bi′ followed by I′ on a unit framing vector. Submultiplicativity and operator norm bounded by Frobenius norm give ∥g∥op≤Ax(1+M(g))k for Ax=k∥C(x)−1∥op. If x is costable, the rows consisting of coordinate rows of JBi1⋯Bim span V∗: their common annihilator is the largest common Bi-invariant subspace in ker⁡J, hence zero. The same finite dimension-growth argument as for columns gives a row basis D(x) using words of length at most k−1. Since D(x′)=D(x)g−1, the identical norm estimate gives ∥g−1∥op≤Ax′(1+M(g))k. This also proves costability is open, since it is covered by the nonvanishing determinants of finitely many such row frames.

2.1F3F4step 1.1algebra

Define Fζ(g)=M(g)2−ζlog⁡det⁡(g†g). It is continuous and invariant under left U(V). By [F4], the positive eigenvalues of g†g are at most ∥g∥op2, so det⁡(g†g)≤∥g∥op2k. The column bound in step 1.1 therefore gives log⁡det⁡(g†g)≤Cx+2k2log⁡(1+M(g)), with Cx=2klog⁡max⁡{1,Ax}. Since log⁡(1+M)≤M for M≥0, a sublevel Fζ≤c with ζ>0 bounds M by the quadratic inequality M2−2ζk2M−ζCx≤c, and hence bounds g. The same sublevel gives det⁡(g†g)≥e−c/ζ>0; bounded entries and the adjugate formula therefore bound g−1. The sublevel is closed in the finite matrix space, since any matrix limit remains invertible by this determinant bound. It is compact by [F3]. The nonempty sublevel at Fζ(I) has a minimum, which is a global minimum since all points outside have larger value. For ζ=0 and regular x, F0=M2 directly bounds M, and the two word bounds in step 1.1 bound both g and g−1; the same closedness/compactness argument gives a minimum.

3.1F1F4F7step 2.1algebra

Let H=H† and vary g by etHg. Differentiating the finite trace expressions gives ddtFζ(etHg)∣t=0=2tr⁡(H(μR(x′)−ζI)): a Bi′ term contributes 2tr⁡H[Bi′,Bi′†], the I′ term contributes 2tr⁡HI′I′†, the J′ term contributes −2tr⁡HJ′†J′, and log⁡det⁡(g†e2tHg) has derivative 2tr⁡H. These derivatives of etH follow by applying the real-matrix supplier to ρ(H) and using [F7]. Thus each minimum from step 2.1 is balanced, because the trace pairing on Hermitian matrices is nondegenerate. Conversely a balanced point is critical: these Hermitian directions and the skew-Hermitian directions tangent to the left unitary orbit span every real tangent direction of GL(V), and the latter derivatives vanish by unitary invariance.

4.1F2F4step 3.1algebra

Diagonalize H by [F4], with real eigenvalues λi. Along the preceding path the squared Bi′ entries have factors e2t(λa−λb), the squared I′ entries have e2tλa and the squared J′ entries have e−2tλa. The log determinant is affine in t. Hence Fζ′′ is a sum of 4w2∣z∣2e2tw over those entries and their listed weights w, and is nonnegative. It can vanish only when [H,Bi′]=0, HI′=0 and J′H=0. Stability of x′ then forces H=0, by applying H to all spanning word vectors. Thus the path is strictly convex for every nonzero H. Given two critical matrices g1,g2, diagonalize the positive matrix (g2g1−1)†(g2g1−1) and take the positive logarithms of its eigenvalues to write g2g1−1=ueH with u unitary and H Hermitian. The endpoints of etHg1 are both critical, after removing u by invariance. Strict convexity forces H=0, so g2=ug1. This proves uniqueness of the unitary orbit at either level.

5.1F1step 2.1step 3.1step 4.1algebra

Suppose now that x is stable and μR(x)=0. For a common invariant subspace S⊆ker⁡J, write V=S⊕S⊥ and Bi=(AiCi0Di), I=(IS,IS⊥)T, J=(0,JS⊥). The trace on S of the real equation is 0=∑i∥Ci∥2+∥IS∥2. Thus all Ci and IS vanish. Then S⊥ is invariant under both Bi and contains I(W), so stability gives S⊥=V, hence S=0. This proves automatic costability at zero real level. Combining with existence and uniqueness from steps 2.1–4.1 proves both asserted bijections of orbit sets.

6.1F2F3F4F5F6F7step 3.1step 4.1step 5.1algebra∎

At a balanced datum x, let Lx:Herm⁡(V)→Herm⁡(V) be H↦ddtμR(etH⋅x)∣t=0. Step 4.1 gives 2tr⁡(HLxH)=Fζ′′(etH)∣t=0>0 for nonzero H, so Lx is injective and hence invertible in finite equal dimensions. The map (H,y)↦μR(eH⋅y)−ζI is smooth by [F7] and the polynomial formula for μR. By [F5] the balancing H=H(y) is locally Cr for every finite r, and uniqueness glues these branches to the same smooth map. The same invertible derivative along the Hermitian gauge directions in TxXs proves that the real-level locus is a smooth submanifold. The unitary group is compact (closed bounded matrices), its action there is free by [F2] and proper (inverse images are closed subsets of U(V) times a compact coordinate projection); therefore its quotient is smooth by [F6]. The map to the complex quotient is smooth using local submersion sections in [F6]. On any word-frame chart [F2], the local balancing map just constructed, followed by the unitary quotient map, is its smooth inverse; step 4.1 proves independence of all choices. Thus the bijections are diffeomorphisms. The compact torus commutes with gauge actions and preserves both the complex equation and μR, so the bijections are equivariant. For k=0 all matrices and equations are empty and all quotients are points, proving every boundary case stated. No sheaf or ASD identification was used.

Depends on

Dependency tree · 2 levels

Sources