Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passverified 2026-11-05 (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.

Conditional nodal gluing regularity for Pardon implicit atlases

Statement

Let P be a finite-dimensional smooth parameter manifold, locally charted by open subsets of RN, whose coordinates include one complex smoothing parameter q∈C for each node, with the family locally given by xy=q. Let B,Y be real Banach spaces: real normed vector spaces complete in the metrics induced by their norms. A map on these charts is C1 when its Fréchet derivative exists everywhere and is continuous in operator norm. Let F:P×B→Y be C1, and put Dp=DxF(p,0). For a bounded linear map D:B→Y, Fredholm means that its kernel is finite dimensional, its range is closed, and its cokernel Y/ran⁡D is finite dimensional; its index is dim⁡ker⁡D−dim⁡coker⁡D. Assume Dp is Fredholm of constant index d and its kernels form a C1 vector bundle of rank d. Suppose there are C1 approximate right inverses Tp:Y→B with ∥Tp∥≤K and ∥DpTp−1Y∥≤δ<1, and the exact right inverses Qp:=Tp(DpTp)−1 vary C1. Set C0=max⁡{1,K/(1−δ)}. Assume there are L,η,r,ρ>0 with C0L(ρ+C0r)≤14,C0(η+Lρ2/2)≤r/2, such that ∥F(p,0)∥≤η and ∥DxF(p,x)−Dp∥≤L∥x∥ for ∥x∥≤ρ+C0r. Finally, assume the local parameters split into kernel coordinates and other chart coordinates so that each specified forgetting map is a coordinate projection. A finite group Γ with identity 1 is given with a smooth left action αP:Γ×P0→P0 on a neighborhood P0⊆P and representations ρB:Γ→GL(B) and ρY:Γ→GL(Y) by bounded linear isometries. These actions satisfy the identity and composition laws and preserve the chosen local data. They obey F(αP(γ,p),ρB(γ)x)=ρY(γ)F(p,x). Each specified forgetting projection π:P0→P′ is Γ-equivariant for a specified action αP′ on P′, meaning π(αP(γ,p))=αP′(γ,π(p)). For a Fredholm operator D, its determinant line is det⁡(D):=Λmax⁡ker⁡D⊗(Λmax⁡coker⁡D)∗. Supply a C1 orientation of the determinant-line family det⁡(Dp). The finite-dimensional obstruction parameter space is an oriented real vector space E included explicitly in the parameter data: in each chosen chart specify Ploc=Pbase×E, with Pbase oriented, and write the equation as F((a,e),x)=0 for a∈Pbase, e∈E. The case E=0 is allowed. Give P the resulting product orientation, so the orientation of E is counted once inside TP, rather than as an additional undeclared equation factor. Require these product and determinant-line orientations to agree on chart overlaps and to be preserved by the stated group actions. All orientation conclusions below concern precisely these supplied data. Then near (p0,0) the zero set of F is a C1 manifold of dimension dim⁡P+d; its trivial-stabilizer locus {(p,x)∈F−1(0):{γ∈Γ:αP(γ,p)=p,  ρB(γ)x=x}={1}} has a free Γ-action and its quotient is a C1 manifold. The specified coordinate-forgetting maps on the zero set are submersions; on free source and target loci their induced quotient maps are submersions. The zero-set orientation is induced by the parameter orientation (including E) followed by the Fredholm determinant-line orientation, with the finite exact-sequence convention specified in the proof. These are conditional local regularity conclusions; the analytic gluing estimates are hypotheses, not conclusions.

Facts & Assumptions

Given: The Banach spaces, family F, Fredholm operators Dp, bounds, finite-group compatibility, explicit oriented factor E of each parameter chart, and compatible parameter/determinant-line orientations in the Statement.

[F1]

Pardon implicit atlases and virtual fundamental class package: an implicit atlas prescribes invariant regular thickening manifolds, extra-section projection models over preimages of lower regular loci, relative covering-group freeness, compatible zero-set quotients, and virtual orientation local systems. It does not demand transverse obstruction recording maps.

[F2]

Pardon Gromov topology on stable J-holomorphic map moduli: the nodal smoothing parameters describe neighborhoods in the stable-map Gromov topology.

[F3]

Banach space defines a real Banach space as a complete normed real vector space. Fredholm operator cokernel and index defines a Fredholm operator as bounded with finite-dimensional kernel, closed range and finite-dimensional cokernel, and index dim⁡ker⁡D−dim⁡coker⁡D. A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point gives a unique fixed point for a contraction of a nonempty complete metric space into itself.

[A1]

Pardon, Appendix B, Theorem B.1.1 and §§B.5–B.13: the intended application obtains the vanishing residual, uniformly bounded approximate right inverses, quadratic estimates and continuity from weighted Sobolev gluing. These source estimates have not been reconstructed as local suppliers; the present theorem assumes the explicit uniform bounds in its statement.

Proof

1.1givenF3algebra

Since ∥1Y−DpTp∥≤δ<1, the Neumann series (DpTp)−1=∑m≥0(1Y−DpTp)m converges in operator norm and has norm at most (1−δ)−1. Define Qp=Tp(DpTp)−1. Then DpQp=1Y and ∥Qp∥≤C0. Hence B=ker⁡Dp⊕im⁡Qp: for every x, write x=(x−QpDpx)+QpDpx, with the first summand in ker⁡Dp; if Qpy∈ker⁡Dp, then y=DpQpy=0. By [F3], the Fredholm index is dim⁡ker⁡Dp−dim⁡coker⁡Dp; the right inverse makes the cokernel zero, so the index equals dim⁡ker⁡Dp=d.

2.1givenstep 1.1algebra

For k∈ker⁡Dp with ∥k∥≤ρ, the fundamental theorem of calculus along tk and Dpk=0 give ∥F(p,k)∥≤η+Lρ2/2. For y∈Y with ∥y∥≤r, set Gp,k(y)=y−F(p,k+Qpy). The derivative bound and ∥Qp∥≤C0 give ∥DyGp,k(y)∥=∥1Y−DxF(p,k+Qpy)Qp∥≤C0L(ρ+C0r)≤1/4, since DpQp=1Y.

3.1F3givenstep 1.1step 2.1construct

Also ∥Gp,k(0)∥=∥F(p,k)∥≤r/2. For ∥y∥≤r, step 2.1 gives ∥Gp,k(y)∥≤∥Gp,k(0)∥+∥y∥/4≤3r/4, so the closed radius-r ball is mapped into itself. It is nonempty because it contains 0. It is complete: a Cauchy sequence yj in this ball converges to some y∈Y by the Banach completeness in [F3], and ∣∥y∥−∥yj∥∣≤∥y−yj∥→0 gives ∥y∥≤r, so the limit remains in the ball. The derivative bound makes Gp,k a contraction there with constant at most 1/4. By [F3] it has a unique fixed point y(p,k) in that ball, equivalently F(p,k+Qpy(p,k))=0.

4.1givenstep 1.1step 2.1step 3.1algebra

In a C1 local trivialization of the kernel bundle put x=(p,k) and H(x,y)=F(p,k+Qpy). Its derivative in y is DyH=DxF(p,k+Qpy)Qp=1Y+(DxF−Dp)Qp. The perturbation of 1Y has norm at most C0L(ρ+C0r)≤1/4, so DyH is invertible by its Neumann series, with a uniformly bounded inverse. Fix x and put y0=y(x). Comparing the two fixed-point equations with y0 held fixed gives ∥y(x′)−y0∥≤14∥y(x′)−y0∥+∥Gx′(y0)−Gx(y0)∥. Hence ∥y(x′)−y0∥≤43∥Gx′(y0)−Gx(y0)∥→0 by continuity at the single point (x,y0). This proves continuity without a uniform derivative bound on the entire Banach ball. Continuity of DxG at (x,y0) now bounds it on a product neighborhood of this point. Shrink the finite-dimensional parameter neighborhood to a convex ball; the already proved continuity keeps y(x′) in that product neighborhood. Integrating DxG along the parameter segment, at the fixed value y(x′), and using the same contraction comparison gives a local bound ∥y(x′)−y(x′′)∥≤C∥x′−x′′∥. For an increment h in the finite-dimensional x variables, expand H(x+h,y(x+h))−H(x,y(x))=0. The preceding Lipschitz bound and Fréchet differentiability give y(x+h)−y(x)=−(DyH)−1DxH h+o(∥h∥). This derivative is continuous because H is C1, y is continuous, and inversion is continuous on boundedly invertible operators. Thus y(x) is C1, with no implicit-function theorem invocation. Conversely, a sufficiently small zero z decomposes uniquely as z=k+Qpy with y=Dpz and k=z−QpDpz; continuity of these projections makes ∥k∥<ρ and ∥y∥<r after shrinking the neighborhood. It is then the unique fixed point above. The zero set is locally a C1 graph over (p,k) and has dimension dim⁡P+d.

5.1givenF1step 4.1constructalgebra

Each specified forgetting map is the coordinate projection on the graph coordinates (p,k) of step 4.1. Its derivative is surjective, so it is a submersion on the zero set. The assumed equivariance makes F−1(0) invariant under Γ. For a point with trivial stabilizer, finiteness of Γ and Hausdorffness of the zero-set chart let us choose a neighborhood disjoint from each of its nonidentity translates; its quotient map is therefore a C1 chart. These charts give a C1 manifold on the trivial-stabilizer quotient. On loci where source and target stabilizers are trivial, the equivariant forgetting maps descend, and the quotient charts identify them locally with the original submersions.

6.1givenF1A1step 1.1step 3.1step 4.1step 5.1∎

At a solution z=(p,x) in the graph chart put A=DxF(p,x). By the same bound as in step 4.1, AQp is invertible; hence R=Qp(AQp)−1 is a right inverse of A. The map k↦k−RAk identifies ker⁡Dp with ker⁡A: its inverse is the projection v↦v−QpDpv from step 1.1, as follows by writing v=k+Qpy and solving Ak+AQpy=0. This is a continuous family of finite-dimensional isomorphisms and equals the identity at x=0; continuity suffices for transporting orientations. Both Dp and A are surjective, so their determinant lines are the top exterior lines of their kernels, with the zero-cokernel factor canonically R. Transport the supplied orientation of det⁡(Dp) through this isomorphism to det⁡A. The finite-dimensional exact sequence 0⟶ker⁡A⟶TzZ(F)→pr⁡TPTpP⟶0 has first map b↦(0,b) and is surjective at the last term: for v∈TpP, (v,−RDparF(p,x)v) lies in the tangent kernel of the total derivative, where DparF here denotes the derivative in the parameter variable. Wedge a kernel basis followed by lifts of a parameter basis, then reorder the two determinant factors with the fixed sign (−1)ddim⁡P to use the parameter-first convention. This identifies the oriented zero-set determinant with det⁡(TpP)⊗det⁡A. Since p=(a,e) and F((a,e),x)=0, the E orientation occurs precisely once in det⁡(TpP)=det⁡(TaPbase)⊗det⁡E. There is no orientation of an infinite-dimensional equation space being taken. The supplied overlap and group-action compatibility therefore orients the local zero sets consistently and descends on the free quotient. These conclusions give the stated conditional smooth-thickening regularity. An application must still verify the relative extra-section projection models and covering-group conditions in [F1]; coordinate forgetting on a solution manifold alone is not their proof. The weighted analytic estimates in [A1] remain inputs.

Depends on

Dependency tree · 2 levels

Sources