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 consists of finitely many distinct boundary marks , a coordinate on a deleted lower half-disk at each mark, with and , and ordered adjacent boundary conditions. The lower-half coordinate can be obtained from an upper-half boundary coordinate by the holomorphic change ; 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 have complex rank , and let 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 , and an identification taking 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 . Fix the first frame so . The conjugation associated with is for ; it is an antilinear involution. Put . A weight is admissible if no eigenvalue of lies on the ray . Use the logarithm branch on the complement of this ray that defines
The corresponding real matrix , 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 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 has the usual finite-chart norm on a fixed core and the norm
on each end, with trace in at its two edges. For its continuous representative tends to zero at each corner, by the uniform unit-patch Sobolev estimate and its weighted tail norm. For this space consists of Sobolev equivalence classes with the stated weak edge traces; no pointwise limit or point evaluation is imposed. The target uses the same weighted norm through order for cylindrical 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 with the old section
The new real boundary frame has trace on both edges and at their common marked point. Gluing with the given core frames defines the smooth capped pair on . 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 , with no clean-intersection requirement, or is allowed to vary in an explicitly prescribed smooth local clean intersection , where 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 , weighted configuration maps are continuous at the corner and locally away from it, have these edge labels, and in the edge-dependent charts of the justifying lemma have remainder in after subtracting the fixed or moving asymptote. The moving branch includes its finite-dimensional coordinate. When an end operator coefficient decays only as , 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 , consistent with . 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
Used by
Dependency tree · two levels
14 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Chris Wendl, Lectures on Holomorphic Curves in Symplectic and Contact Geometry (standard reference, not scraped)