Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedverified 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.

Spectral-cut cappings and weighted label-changing corners

Definition

Assume the Axiom of Choice (full AC), as in the justifying weighted Fredholm and configuration lemma.

A spectral-cut corner datum on a compact bordered Riemann surface S consists of finitely many distinct boundary marks bj, a coordinate z=e−s−it on a deleted lower half-disk at each mark, with s≥0 and 0≤t≤π, and ordered adjacent boundary conditions. The lower-half coordinate can be obtained from an upper-half boundary coordinate by the holomorphic change z↦−z; the order of its two edges is recorded. All marks and collar coordinates persist in the specified local family; they are not smoothing nodes.

For linear data let E→S∖{bj} have complex rank m, and let F be a smooth totally real boundary condition on the open arcs. At each end choose a complex trivialization, a pair of real totally real planes F0,F1⊂Cm, and an identification taking F to these constant edge planes, with the identification and operator coefficients converging exponentially to their limits with all required cylindrical derivatives. A real plane is totally real when F⊕iF=Cm. Fix the first frame so F0=Rm. The conjugation τj associated with Fj is v+iw↦v−iw for v,w∈Fj; it is an antilinear involution. Put M=τ1τ0. A weight 0<δ<1 is admissible if no eigenvalue of M lies on the ray e−2πiδR>0. Use the logarithm branch on the complement of this ray that defines

A=−12πilog⁡M,δ<Re⁡spec⁡A<δ+1.

The corresponding real matrix A, including its nilpotent parts, is part of the specified capping convention. Its existence for every totally real pair and every admissible cut is proved in the justifying lemma; diagonalizability, compatibility of J with a symplectic form, unit-circle spectrum, and clean intersection of the labels are not assumptions for this linear datum.

The fixed-asymptote section space Xδk has the usual finite-chart Hk norm on a fixed core and the norm

∥ξ∥k,δ2=∑a+b≤k∫0∞ ⁣∫0πe2δs∣∂sa∂tbξ∣2 dt ds

on each end, with trace in F0,F1 at its two edges. For k≥2 its continuous representative tends to zero at each corner, by the uniform unit-patch Sobolev estimate and its weighted tail norm. For k=1 this space consists of Sobolev equivalence classes with the stated weak edge traces; no pointwise limit or point evaluation is imposed. The target Yδk−1 uses the same weighted norm through order k−1 for cylindrical (0,1) coefficients, with no boundary trace condition. Coordinates on a finite family are required to have uniform coefficient bounds and an admissible spectral cut separated from the spectra; the weight is fixed while those bounds hold.

To cap, replace the deleted half-disk by a filled half-disk carrying a new complex frame, and on its punctured overlap identify a new section v with the old section

ξ=G(z)v,G(z)=zA=exp⁡(Alog⁡z).

The new real boundary frame has trace Rm on both edges and at their common marked point. Gluing with the given core frames defines the smooth capped pair (E^δ,F^δ) on S. Define the cut-dependent capped Maslov integer μδ to be the first Chern degree of its conjugate double. This is the Maslov integer of the capped pair; it is not the degree of an undefined continuous bundle formed by identifying two unequal old trace planes at a mark.

For nonlinear data, the adjacent labels are smooth embedded totally real submanifolds of an almost-complex target. Each asymptote is either fixed at a specified point pj∈L0∩L1, with no clean-intersection requirement, or is allowed to vary in an explicitly prescribed smooth local clean intersection Cj=L0∩L1, where TpCj=TpL0∩TpL1 and the dimension is constant. A chosen smooth parameter submanifold of the intersection may instead be imposed as an explicit restriction of the moduli problem; it must not be called the full moving-intersection problem. For integer k≥3, weighted configuration maps are continuous at the corner and locally Hk away from it, have these edge labels, and in the edge-dependent charts of the justifying lemma have remainder in Xδk after subtracting the fixed or moving asymptote. The moving branch includes its finite-dimensional Cj coordinate. When an end operator coefficient decays only as O(e−ϵs), a constant asymptote augmentation requires δ<ϵ (or the explicitly checked condition that its image belongs to the weighted target). Smooth ordinary forcing at a marked point has cylindrical order O(e−s), consistent with δ<1. At nodes, retain the original equality-of-values matching, with the same label on both sides of a boundary node.

The corner topology is the weighted Sobolev topology of these remainders and the ordinary topology of the asymptote parameters, combined with the domain-family coordinates. At nodes one uses the ordinary gluing topology with these persistent corner norms. For the branch with no genuine label jumps and no imposed corner vanishing condition, use the original smooth-boundary finite-chart spaces and graph topology. The weighted corner moduli problem is an explicit extension with different regularity/topology; it does not assert that every finite-energy map or every graph-near map belongs to a chosen positive exponential weight, nor that ordinary smooth-up-to-the-marking maps form its entire solution set.

Depends on

Dependency tree · 2 levels

Sources