Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

Same-trace unit-window normalization of finite marked Floer families

Statement

Assume AC and the finite exact stopped brane datum. Fix one finite ordinary or independent-block marked Floer context: finitely many actual branes/transverse Hamiltonian copies; a finite ordered word of smooth Hamiltonian brane paths, with their original transported primitives and inverse/refinement decorations; compact external parameter cells; and positive sitting atom durations fixed or in compact intervals bounded away from zero. Include the actual stable punctured-disk trees, transition-only vertices, protected Moore-gap subfamilies, literal finite merged-word faces and stationary growing real-node strips. A formal identity or a fixed-scale Morse/PSS cap is its separate source fixture, not a limit obtained by dividing by a zero atom duration. Each atom and shared parameter is retained exactly once. The brane paths are the actual homogeneous-at-infinity Hamiltonian lifts, including their compact-body pieces; no primitive constant is reset.

There is a choice of strip ends, component cores, smooth moving-boundary clocks, and extensions of compatible lower-face Floer data with the following conclusions. The construction is from those data; uniform estimates are conclusions, not additional hypotheses. Compatible prescribed lower-face germs mean actual smooth data on normalized source/parameter collars agreeing on their overlaps under the iterated face identifications, with the stated stationary ends. Clocks not already supplied as such coherent germs are among the choices constructed here; arbitrary endpoint-compatible nonnegative clock derivatives are not asserted to have a smooth nonnegative extension. After normalizing each stable component and retaining every marked component, the fibers have a complete conformal unit-window atlas of bounded overlap. For some context-dependent r0>0, every finite source point lies in an interior disk or one-edge boundary half-disk of radius at least r0 in that atlas. A boundary half-disk has exactly one smooth boundary trace, even when centered at a transition mark or translated arbitrarily far along a node strip. Distinct ordinary labels meet only at removed strip punctures; a moving transition mark carries its actual smooth sitting path, not an instantaneous boundary-plane jump. Finite merges concatenate those paths smoothly, and nodal faces use their recorded component/node chords. No multi-label marked vertex is deleted as an ordinary bubble.

For every compact target window C, every finite derivative order a has a constant Ka(C) controlling on these normalized windows the pulled-back almost-complex structure, Hamiltonian forcing, moving embeddings, and a finite family of boundary-adapted tubular charts and their inverses. There is a fixed positive lower bound for their total-reality singular values and a fixed chart radius. The same bounds hold in every bounded separable perturbation ball built from the rescaled smooth bump construction below. Growing necks remain exactly stationary; constants are independent of their lengths, relative homotopy sectors and positions of translated unit windows. They may depend on the finite word and its compact external data. Bounds concern normalized spatial coordinates and the actual compact coefficient parameters, not derivatives in a singular raw plumbing coordinate at its zero fiber.

Consequently the usual one-smooth-trace linear estimate and nonlinear gradient-normalized bootstrap apply to the actual retained families. For a blow-up scale Mj→∞, explicit source derivatives of order a acquire Mj−a and the forcing acquires the additional factor Mj−1. Target derivatives of J survive. After component normalization a rescaled boundary limit has one fixed exact brane; two distinct strip edges cannot both survive at bounded rescaled distance. With a supplied common compact image and Floer energy bound, the gradient-normalized limits therefore have finite energy and are nonconstant planes or one-brane half-planes. This is the applicability input for the exhaustion-Stokes contradiction; no compactification, corner Fredholm or nonlinear gluing theorem is assumed or proved by this lemma.

Facts & Assumptions

Given: Exactly the finite data in the Statement. Each bounded target window used below is chosen before estimating maps; no compactness or regularity of the current solution space is assumed.

[F1]

The branes are properly embedded exact conical Lagrangians with the actual primitives, and their almost-complex structures are tame; the stipulated end charts and homogeneous lifts are those of the datum. Stopped four-dimensional Lefschetz data and exact conical branes

[F2]

The fixed transverse strip ends have the actual weak linear realization and Fourier inverses; this fact supplies neither nonlinear regularity nor any marked-family normalization. Weighted disk Fredholm parametrices and matched real-boundary neck inverses

[F3]

The ordinary finite-dimensional inverse theorem follows by applying the Banach inverse theorem to Euclidean charts. AC permits the separate finite-context choices. Inverse function theorem for Banach spaces, The Axiom of Choice

Proof

Given: [F1]–[F3]. We first construct normalized windows and smooth traces, then derive coefficient and inverse-chart bounds on the actual compact target window.

1.1F1F3givenconstructalgebra

Normalize three flags of a smooth ordered disk to ∞,0,1 on its real boundary. Its remaining flag positions have the fixed cyclic inequalities. For a degenerating sequence, take their limits in RP1; each coincident consecutive cluster is resolved by subtracting its first coordinate and dividing by its positive extremal separation. Its attachment is the child's infinity flag. Repeat inside each remaining cluster. Each resolution splits a finite cluster into smaller nonempty clusters, so it terminates. The identity ∑v(val⁡(v)−2)=N−2 bounds a stable tree's vertices and edges. Quadruple cross-ratios determine its components and clusters recursively, so the closure in the finite cross-ratio cube is exactly this compact stable-tree space. Transition marks are included in N and in every cluster, even on a transition-only child. Thus the construction does not replace the actual marked family by its ordinary unmarked stabilization.

2.1F3step 1.1constructalgebra

Around a fixed stable tree choose three distinct flags on each component, and restrict its free positions to a relatively compact neighborhood with all its component flags still distinct. For a parent attachment a and child coordinate x, use z=a+ρx and w=−1/x; then (z−a)w=−ρ. At ρ=0 keep both normalized components. Finite products of these fixtures, with the complements of fixed disjoint flag disks, are actual holomorphic local families. Different anchor choices are rational Möbius maps with denominators bounded away from zero on these fixed cores and transition annuli. Their coordinate derivatives and inverse derivatives are bounded there. Compactness in step 1.1 gives finitely many such tree neighborhoods for each finite context. This is a finite cover of normalized component parameters, not a positive lower bound on distances of colliding marks in a single unnormalized root coordinate.

3.1F2F3step 2.1constructalgebra

On a real fixture put z=e−πs+iπt and w=e−π(L−s)+iπ(1−t), 0≤t≤1, so zw=−e−πL. The change between its two logarithmic coordinates is (s,t)↦(L−s,1−t), an isometry. Choose fixed attachment annuli, independent of L. Their overlap with component core charts lies at fixed nonzero radii, so the logarithm and its inverse have bounded derivatives there. Long middles use translated width-one strips. Short fixtures have ρ bounded away from zero and belong to an ordinary compact nonsingular family, covered by finitely many charts. The parent core omits its child cluster disk: the small affine derivative ρ is therefore never used as a unit-window transition between two retained compact cores. They are joined through the just-constructed logarithmic fixture. A partition over fixed attachment annuli gives a complete conformal metric with uniformly bounded unit charts. Unit strips have a bounded-overlap rectangular cover; the finite core cover does too. Choosing r0<1/8 and shrinking the finitely many core charts if needed, an interior disk or a boundary-centered half-disk of a fixed comparable radius covers every point. A half-disk in a strip meets at most one of t=0,1. At a zero node work on its two punctured normalized branches; it is not a finite boundary corner of one window.

4.1F3step 1.1step 2.1step 3.1constructalgebra

The protected Moore models are closed restrictions of this stable-tree family by qi≤e−πTi. On a spine component, logarithmic adjacent mark coordinates give τi+1=τi+Ti+ℓi. At a finite merge ℓi=0, the internal marks remain at their summed atomic offsets; the concatenated block has the sum of its durations. At a node qi is a positive smooth unit times the product of the actual edge parameters along its spine path. Consequently the long geometry is covered edge by edge by step 3.1, even when a total mark gap is not an independent coordinate. Active finite faces have qi∈(0,1) on the same normalized component, so their logarithmic differences and inverses have bounded derivatives in its compact flag neighborhood. At intersections of finite faces, summing the same ordered offsets is literally associative. No factor 1/ℓi is introduced at ℓi=0. These restrictions inherit all the normalized windows.

5.1F1F3step 1.1step 2.1step 3.1step 4.1constructalgebra

We specify the relative problem on the actual finite face diagram. Include every stable tree of the given labelled word, every finite consecutive-block substitution, and every external parameter face; this is a finite diagram for the fixed context, by step 1.1 and the finite number of atoms and external cells. Near a corner its base coordinates are (x1,…,xc,y), with xj≥0: ordinary node coordinates are the independent ρe, active protected finite coordinates can be the ℓi, and external coordinates are the distances to the selected cube or cell faces. An active finite constraint cannot cross a zero node, since its ratio is positive; it concerns marks on a single normalized component. Thus its independent logarithmic difference is a valid component coordinate as in step 4.1. Setting a subset of these coordinates to zero defines commuting local retractions πI, with πIπJ=πI∪J. Disjoint node fixtures glue in either order. Nested nodes are different fixtures on the retained normalized components, so their quotient identifications also commute. Overlapping finite substitutions reconstruct the same original atomic offsets in either order. Finite substitutions and node restrictions commute because their atoms are either on the same surviving component or are partitioned among the node components, never copied. If Ti varies with an external parameter, use the coordinates ℓi=τi+1−τi−Ti(p); retraction holds these ℓi fixed, so it still commutes with setting an external face coordinate to zero. A genuinely shared parameter remains one coordinate throughout. Away from removed ordinary punctures and nodes, the actual universal family is smooth in these coordinates; all transition-mark neighborhoods are retained. Its normalized cores are product charts over the corner; on ends use the logarithmic strip products of step 3.1. No transition mark is converted into a removed strip puncture.

6.1F3step 5.1constructalgebra

Here is the needed elementary relative extension calculation, rather than an appeal to contractibility. In one such product chart let fi be a smooth section on xi=0, with values in a fixed linear coordinate space, and assume its restrictions agree on every face intersection under the actual identifications of step 5.1. Write fI for that common restriction to xi=0 for i∈I. Define E(f)(x,y)=∑∅≠I⊆{1,…,c}(−1)∣I∣+1fI(πI(x,y)). On xj=0, the terms for I not containing j cancel with those for I∪{j}; the one remaining term is fj. This proves every face restriction simultaneously, including all mixed tangential derivatives. The formula is a finite sum of smooth functions and has no quotient by xi, ρe, a gap, or their sum. For sections use a local frame on the normalized source product before making the same calculation. If the required values form an open convex subset of that coordinate space, the expression has the required value at every point of the corner, and continuity keeps it in that subset after shrinking about that point. Over a compact source/parameter subchart the shrink and every fixed derivative bound are uniform. This proves a local extension into an open convex set; it makes no false extension assertion for an arbitrary closed positivity cone.

7.1F3step 5.1step 6.1constructalgebra

Local extensions into an affine or open convex fiber can be joined without losing the restrictions. Choose finitely many smaller base charts covering the compact base, smooth nonnegative Euclidean bump functions ηα supported in the larger charts and positive on the smaller ones, and set χα=ηα/∑βηβ. The denominator has a positive minimum on the compact set. These functions depend on the base, not on a clock's source coordinate. The weighted sum of the local sections has the prescribed restriction on every face because all summands have that restriction; convexity preserves the allowed fiber. Smooth coordinate changes are used to regard the summands as sections of the same actual source bundle before adding them. A prescribed genuine collar germ is preserved more directly: represent it on neighborhoods Ui of the relevant faces, shrink them so the representatives agree on all actual overlaps, and hence obtain one section fU on U=⋃iUi. For clocks first remove the source-end tails where both prescriptions are already the same constant. The remaining normalized cores over a compact face neighborhood are compact. Consequently U contains every such core over some smaller base neighborhood: otherwise points in the closed complement with bases tending to the prescribed closed face set would have a convergent core subsequence ending in U. A base-only cutoff is therefore available. Choose it equal to one on a smaller base neighborhood and supported in this one; replace any extension by χfU+(1−χ)f0. The term χfU extends by zero outside its support, so the formula is smooth and equals the whole prescribed germ on a smaller collar. The same construction is local in the source/target variables when necessary; on any preselected compact target window finitely many patches suffice. Thus values on lower faces are extended by step 6.1, whereas an already supplied compatible germ is preserved exactly rather than replaced by an independently chosen constant-normal germ.

8.1F1F3step 2.1step 3.1step 5.1step 6.1step 7.1constructalgebra

We first make coherent choices in an open cone, before constructing monotone clocks. On the real boundary, oriented in the logical transition direction, choose a positive vertical vector field Vi near each original transition mark. This is opposite the positive source-boundary traversal on its transition arc, as fixed by the actual word convention; thus the original monotonicity sign is retained. Such fields exist locally by the product charts in step 5.1, and positive multiples of the oriented coordinate vector form an open convex half-line. Their prescribed restrictions from lower faces are extended by steps 6.1–7.1 in that open half-line; genuine prescribed field germs are kept by the last formula of step 7.1. Choose these fields inductively over the finite face diagram, starting at its zero-dimensional strata and then increasing the dimension of the parameter cell. The face restrictions of a new cell are already chosen, and their multiple intersections agree by the preceding stages and the commuting actual identifications of step 5.1. The local formula extends all of them at once; it is not a succession of corrections that destroys a previous face. In a finite normalized cover, positivity and compactness give a common positive lower bound and upper derivative bounds for Vi on a smaller neighborhood of its mark. Shrink these neighborhoods to be disjoint for distinct marks on each retained component and away from node and ordinary-puncture fixtures. This is possible in the normalized family: marked sections never hit a node on their own normalized component, even if their parent-coordinate images collide. For a fixed finite diagram take the minimum of the finitely many resulting positive widths. This constructs the coherent marking neighborhoods and vector fields, rather than assuming them. The construction also applies to an off-spine transition-only component, which retains its marks and its node ends.

9.1F1F3step 3.1step 4.1step 8.1constructalgebra

Fix a smooth nonnegative bump β supported in (1/4,3/4) with integral one, and put B(t)=∫−∞tβ(u) du. The positive boundary field in step 8.1 gives an explicit local time coordinate: if Vi=vi(x)∂x and its mark has coordinate ai, set ui(x)=∫aixvi(ξ)−1 dξ. Then dui(Vi)=1; the inverse function theorem [F3] gives its inverse near ui=0. Choose one fixed δ>0 small enough that 0≤ui≤δ remains in the chosen mark neighborhood for every atom and parameter in the finite diagram. In the protected model also choose it small enough that this neighborhood lies inside the assigned τ-interval of duration Ti; the given positive lower duration bound and the finite upper bound for dτ(Vi) permit that choice. Define the actual atomic clock on this oriented source segment by ci=TiB(ui/δ), extending it by zero before and by Ti after the segment. Its derivative in the logical boundary orientation is nonnegative, and it is constant on neighborhoods of both segment endpoints. Apply the given path γi(p,ci), with its actual transported primitive, to obtain the moving embedding. No target embeddings or primitives are averaged. The derivatives of vi−1 are bounded polynomials in the derivatives of vi and its positive lower bound; derivatives of the inverse coordinate follow by differentiating its identity. Hence all fixed source derivatives of ci are bounded by finite constants involving δ−r, bounded Ti and the already obtained coordinate bounds. No duration tends to zero here; formal identities and fixed Morse/PSS fixtures are treated separately as in the Statement.

10.1F1F3step 5.1step 8.1step 9.1constructalgebra

This choice has the required literal restrictions. On a finite merged block, use the same original atomic marks and on its ith segment use ∑h<iTh+ci as its block clock. Between the atomic segments it has the corresponding constant partial sum. These formulas are smooth at every seam since each clock, and each actual path, is sitting there. They describe the original Moore-concatenated path, with its atomwise clock, rather than replacing it by a new single bump over the total duration. Associativity is literal addition of the same offsets. On a node face, the normalized components inherit the restrictions of the very same marking vector fields, so the time integral in step 9.1 restricts to the lower component's time coordinate; uniqueness of that integral with value zero at its mark gives exact equality, not merely homotopy. Each component owns precisely its original atoms, and the clocks are constant at its before/after node ends. Zero-node branches are separate source windows. Smoothing identifies only those stationary end germs and does not delete a marked component. Thus unrestricted transition-only vertices, chains of simultaneous finite merges, intersections of several node faces, and mixed node/finite/external faces all obey the same formula. No duplicated external or diagonal variable is introduced.

11.1F1F3step 5.1step 6.1step 7.1step 8.1step 9.1step 10.1constructalgebra

The relative assertion also preserves every genuine already prescribed coherent clock germ. Here a germ is an actual smooth clock on a neighborhood of its face in the normalized source family, not only endpoint values or a boundary restriction. Compatibility means equality on the actual collar overlaps after the iterated identifications of step 5.1. Finitely many such germs have representatives on a common smaller neighborhood U of their prescribed face set: shrink pairwise overlaps where their representatives agree and use the finite chart cover. Join that clock cU to the freely constructed clock c0 of steps 9.1–10.1 by c=χ(p)cU+(1−χ(p))c0, with the base-only cutoff of step 7.1. The endpoint and atomic offset constraints are linear, and the oriented source derivative is χ ∂scU+(1−χ)∂sc0≥0 because ∂sχ=0. Hence the result is a valid monotone clock, equals the prescribed whole germ on a smaller collar, and is sitting on the common smaller sitting neighborhoods. Apply the same given atomic paths to it. For clocks not prescribed as such germs the positive-field induction of steps 8.1–10.1 supplies their coherent choice; arbitrary facewise nonnegative densities are not extended by the open-cone formula. This distinction is necessary: equality of endpoint values alone does not make arbitrary transverse collar prescriptions compatible. It adds no uniform estimate as an assumption and excludes none of the genuine compatible germs in the relative problem.

12.1F1F3step 5.1step 6.1step 7.1step 8.1step 9.1step 10.1step 11.1constructalgebra

This resolves the simultaneous induction on actual faces. At a new parameter cell use the already fixed lower component/word data on its ordinary node, finite substitution and external faces. When only lower face values have been fixed, steps 6.1–8.1 construct the new marking fields and therefore the coherent clocks of step 9.1. When an actual coherent collar germ has been fixed, step 11.1 preserves it. At a corner a shared atom or parameter appears on its unique owned component and is the same coordinate in every restriction; the common restriction is therefore independent of the order in which the faces are taken. Charts with different anchor choices need not have commuting global retractions: the calculation uses commuting retractions within each actual product chart, and step 7.1 joins their resulting sections intrinsically. There is no assumption of a global product-cube gap map. Nor is a product of arbitrarily chosen independent constant-normal face extensions used as if it already agreed. This constructs data on every retained face and every interior cell in the finite context while preserving its prescribed coherent subdiagram.

13.1F1F2F3step 2.1step 3.1step 5.1step 6.1step 7.1step 8.1step 9.1step 10.1step 11.1step 12.1constructalgebra

Extend the actual Floer coefficients by this same explicit relative construction. Hamiltonian one-forms on each normalized core form an affine space with the already prescribed linear trace, support and end conditions. In the retained history these include vanishing on ordinary boundary tangents and beyond the fixed target radius, and the stationary strip trace Htdt. A moving boundary remains the actual γi(ci) condition; its Hamiltonian lift is not added as a new forcing on the target end. Take a reference one-form with these fixed traces using fixed source cutoffs, and extend its zero-trace difference from the lower-face data by step 6.1; step 7.1 preserves genuine already prescribed collar germs. All these operations preserve the linear vanishing/support constraints, and do not alter any primitive normalization. At a node the two end germs have the same recorded stationary pair Jt,Htdt for that node/chord; keep this pair unchanged past one fixed end depth, chosen as the maximum of the finitely many prescribed depths. For the tame almost-complex structures, use the compatible reference J0 from [F1] and g0(v,w)=ω(v,J0w); write A∗ for the g0-adjoint and ∥A∥g0 for its induced operator norm. Write J=J0Z, so Z=J0−1J; the equation J2=−1 is equivalent to Z−1=J0−1ZJ0, and tameness is g0(v,Zv)>0 for every nonzero v. Set W=(I−Z)(I+Z)−1. The positive symmetric part of Z makes I+Z invertible. Since W(I+Z)v=(I−Z)v, we have ∥(I+Z)v∥g02−∥W(I+Z)v∥g02=4g0(v,Zv)>0; compactness of the unit sphere gives ∥W∥g0<1. The complex-structure relation gives J0−1WJ0=−W. Conversely, if J0−1WJ0=−W and ∥W∥g0<1, then Z=(I−W)(I+W)−1 satisfies Z−1=J0−1ZJ0 and has positive symmetric part, since Z+Z∗=2(I+W∗)−1(I−W∗W)(I+W)−1>0, so J=J0Z is ω-tame. Thus this is an open unit ball in the real vector space of J0-antilinear endomorphisms, and supplies the convex coordinate for the tame class. Extend the prescribed face germs in this coordinate using steps 6.1--7.1. Near each compact face/source/target chart, continuity of the local extension preserves a fixed strict margin from one; convex patching preserves that margin, and the prescribed germ is unchanged on its smaller collar. Outside the relative neighborhoods use the reference data. Choose the source cutoffs equal to the stationary end pair before a fixed depth and extend only the remaining compact cores. The constructions are local in target charts; a locally finite target partition in the common tame W coordinate preserves convexity and prescribed data, and every fixed compact target window uses only finitely many of these terms. Source/target end data already prescribed are held fixed. This gives actual simultaneous relative coefficients on the finite face diagram, not an invocation of a nonexistent nonlinear corner theorem. Every fixed spatial derivative is bounded on the finite normalized core/compact-target cover; derivatives of (I+W)−1 are bounded by its strict margin and repeated differentiation. The clocks and moving embeddings have the bounds of steps 9.1–12.1. On a growing neck nothing is interpolated across its length: both ends are already exactly stationary and only that stationary pair is sewn. Hence all the claimed pulled-back coefficient bounds are independent of neck length and translated-window position.

14.1F1F2F3step 3.1step 4.1step 5.1step 9.1step 10.1step 11.1step 12.1step 13.1constructalgebra

The absence of a hidden singular scale can be read in the concrete charts. On each node put z=e−πs+iπt as in step 3.1; then ∣z∣=e−πs and ∣∂sa∂tbz∣≤πa+be−πs. A compact-core one-form a(z)dz+aˉ(z)dzˉ therefore pulls back with coefficients and fixed source derivatives bounded by constants times e−πs wherever that expression is used. The stationary part is already Htdt and is not obtained by dividing such a one-form by z. Transitions between the two strip coordinates remain (s,t)↦(L−s,1−t), so their spatial derivatives have no L factor. Cutoffs occur at fixed end depths; their derivatives have fixed bounds. On a finite merge, differentiation uses the actual additive atomic offsets and the fixed positive durations, not 1/ℓi. At simultaneous nodes use one such calculation per independent fixture, rather than differentiating a total gap monomial as if it were one normal coordinate. Thus the estimates just obtained concern precisely the normalized spatial and compact nonsingular coefficient parameters claimed in the Statement; no derivative bound in a singular raw plumbing coordinate is asserted. These facts complete the relative marked-face bridge needed by the later same-trace chart and blow-up steps.

14.2F1F2F3step 13.1constructalgebra

This extension is compatible with the actual permitted relative perturbations. Take a countable smooth bump list on the finite normalized compact cores, with the prescribed zero support near ends and fixed faces. Rescale its jth member so all coefficient derivatives through order j have norm at most 2−j in the finite source/target/compact-parameter charts. For coefficients a in a bounded ℓ2 ball and each fixed order r, the tail ∑j≥rajej has Cr norm at most ∥a∥2(∑j≥r4−j)1/2, plus the finitely many preceding terms. This proves the uniform bounds, and tails tend to zero uniformly while each finite head ranges in a compact finite-dimensional set. Diagonal extraction gives precompactness in every fixed Cr norm. Small balls preserve tameness. Ordinary translation-invariant strip perturbations depend only on t and the target and obey the same calculation. They do not acquire an s derivative under translation. This construction precedes the regular-value choice, so the estimates do not assume regularity or compactness of the current top-dimensional moduli.

14.3F1step 9.1step 11.1step 13.1constructalgebra

Uniform target boundary charts follow from the actual geometric data, not from individual embeddedness alone. For an actual compact family of Hamiltonian lifts Φp, its inverse is a smooth family of diffeomorphisms. Thus ⋃pΦp−1(C) is the compact image of the compact parameter set times C. Properness of each fixed initial brane makes its inverse image of this compact set compact. All moving-brane points that map into C therefore come from one compact subset of its fixed source brane. The homogeneous end formulas give the same conclusion for the actual fixed end germs: on a compact parameter set the radial shift and all contact derivatives are bounded. Finite concatenation, inverse and refinement letters use finitely many compositions/inverses of these same smooth maps, hence still have compact inverse-image windows. Their actual transported primitives are smooth on this compact set; no end constant or seam term is reset.

15.1F1F3step 13.1step 14.2step 14.3constructalgebra

In finitely many coordinate patches of that compact brane source, write the actual moving embedding as ip(x). With a fixed smooth target metric, define Ψp(x,y)=exp⁡ip(x)(Jp dip(y)). At y=0 its derivative sends (v,w) to dip(v)+Jpdip(w). This map is invertible: a vector in both the Lagrangian tangent and its Jp image would contradict ω-tameness. Its least singular value is a positive continuous function on the compact unit-frame parameter set, so it has a positive minimum. All derivatives of ip,Jp and the exponential on the chosen compact target neighborhoods are bounded by steps 13.1–14.3. The inverse theorem gives a uniform smaller radius. To check injectivity is not lost from distant brane points, a contrary sequence would have two preimages separated from the local diagonal in the same compact source, converging to distinct points of an embedded limiting brane with equal image. This is impossible. Therefore a finite cover has a fixed positive chart radius and inverse differential bound. Repeatedly differentiating Ψ−1∘Ψ=id⁡ expresses every higher inverse derivative as a finite polynomial in derivatives of Ψ and its bounded inverse first derivative. This proves all inverse-chart bounds.

16.1F1F2F3step 3.1step 9.1step 11.1step 13.1step 14.3step 15.1constructalgebra

Compose these charts with the actual clocks of steps 9.1–11.1. All source derivatives of the pulled-back embeddings and inverse charts are bounded by the chain rule and the finite clock bounds, including through marked seams and finite merges. At a smooth boundary point the pulled-back J is standard on its real slice by the formula for DΨ in step 15.1. Differentiation of this source-dependent chart adds the genuine term −DΨ−1∂sΨ to the equation forcing; it is bounded with all required derivatives, rather than discarded. The transformed Hamiltonian forcing has the same bounds by step 13.1. On a long strip each finite-radius half-window sees one of its two edge embeddings; it never has to flatten both intersecting labels in one boundary chart. At a retained transition mark the trace is the smooth moving embedding constructed in step 9.1, and at a zero node one first selects a normalized branch as in step 3.1. These are the required complete same-trace windows. No corner Fredholm or nonlinear gluing theorem has entered this construction.

17.1F1F2F3step 3.1step 4.1step 9.1step 13.1step 14.2step 16.1constructalgebra

The remaining retained fixtures do not force a division by a vanishing positive duration. The unstable two-punctured ordinary strip has its translation gauge and the same translated unit windows. A formal identity has its separate constant-profile/forgetful fixture, so its clock derivatives are zero. A fixed-scale Morse/PSS cap has a smooth bordered core and one of the same ordinary strip ends; its attached gradient line is a separate one-dimensional equation and an evaluation constraint, not a jump in the two-dimensional boundary trace. Finite products of these fixtures retain their own parameter blocks once. Fixed transverse-copy sizes are held fixed in each finite context, as in the retained construction; no uniformity as an unretained transverse gap or copy scale tends to zero is inferred. The bounds in steps 3.1 and 13.1–16.1 thus apply to all these actual ordinary, merged, marked, node and fixed-unit/spike windows.

18.1F2F3step 3.1step 13.1step 15.1step 16.1step 17.1constructalgebra

Here is the resulting exact applicability to local elliptic estimates. In a same-trace chart a linearized operator is vs+A(s,t)vt+B(s,t)v, with the quantitative total-reality and chart/inverse bounds of steps 15.1–16.1. A uniformly bounded complex frame puts it in the form ws+iwt+Cw with real flat-edge trace. Integration by parts for compactly supported real-trace w gives ∥∇w∥22=∥ws+iwt∥22; the flat-edge cross term vanishes because the tangential trace is real. Cutoffs give the local H1 estimate. Tangential difference quotients preserve the trace, and the equation recovers normal derivatives, proving the higher estimate with constants determined by the just-derived coefficient bounds. There is no high-order reflection condition on the forcing. The two-dimensional product/composition estimates in these fixed charts give the Hk nonlinear mapping chart and its derivative for k≥4. Finite evaluation and external blocks then remain their actual finite-dimensional blocks. This proves the applicability needed for the order-lifting at29.1 without assuming the nonlinear compactification.

18.2F1F2F3step 3.1step 9.1step 14.2step 15.1step 16.1step 17.1constructalgebra

For gradient blow-up select points in this uniform atlas, not in a collapsing root coordinate. Choose a fixed larger disk or half-disk window around each proposed unbounded-gradient point, and regard only its curved or lateral cutoff edges as artificial boundary. The original source boundary is retained, not counted as an artificial edge. On the closed window maximize the continuous function d(z)∣duj(z)∣, where d is distance to that artificial boundary. Its value tends to infinity because the initial point has a fixed positive distance from it. At its maximizing point zj put Mj=∣duj(zj)∣ and dj=d(zj). On the radius-dj/2 disk or half-disk, d≥dj/2 and hence ∣duj∣≤2Mj; meanwhile djMj→∞. This gives expanding rescaled windows and keeps the selected derivative equal to Mj. In normalized local coordinates put vj(ζ)=uj(zj+ζ/Mj). An explicit source derivative of J of order a has factor Mj−a, and a derivative of the transformed forcing has factor Mj−1−a. The same factors apply to the source-dependent embedding and inverse-chart terms in step 16.1. Target derivatives of J do not disappear. By steps 13.1–17.1, all these unscaled norms were uniformly bounded on the actual retained family. At bounded rescaled distance from the edge one obtains a half-plane with one frozen exact brane; otherwise one obtains a plane. The opposite strip edge is at distance comparable to Mj and cannot produce a second edge in the limit. A transition mark remains a smooth point of its moving trace, while a domain cluster/node was already assigned its normalized marked component before this selection.

19.1F2F3step 14.2step 15.1step 16.1step 18.1step 18.2constructalgebra

For completeness the normalized gradient bound is sufficient for the nonlinear bootstrap, without presupposing derivative compactness. Flatten the one moving boundary by Ψ and write ws+A(z,w)wt=h(z,w). Its tangential derivative v=ws satisfies vs+Avt+(DwA[v])wt=∂sh+Dwh[v]−(∂sA)wt. The bounded gradient and the coefficient bounds above make the coefficients and right side uniformly controlled. The local H1 estimate of step 18.1, first in bounded Lipschitz frames and then by smooth approximation, gives H2 for w; the original equation recovers normal derivatives. At each higher tangential order isolate the top term (DwA[∂sjw])wt as zeroth order. Every other term contains derivatives of w of order at most j; Hölder and the two-dimensional differentiated product estimate bound it by the previous Sobolev norm and the gradient bound. Induction on smaller nested patches gives all fixed derivative bounds, with constants from the actual normalized data. The same argument holds on interior windows. Consequently a diagonal subsequence converges smoothly on each finite rescaled window, and the selected derivative remains nonzero.

20.1F1step 14.3step 15.1step 16.1step 18.2step 19.1algebra∎

If the original solutions have a common image in C and a Floer energy bound E0, then on each fixed rescaled compact window the normalized forcing tends to zero. Equivalence of the tame metric energy and ∣du−XK∣2 on C bounds the limiting holomorphic energy there by a fixed multiple of E0; the extra forcing-square term is O(Mj−2) on a fixed rescaled window. Exhausting the limiting plane/half-plane proves finite total energy. Compactness of the inverse brane windows in step 14.3 also preserves the exact limiting brane and its primitive, with uniform continuity on that window. These are precisely the hypotheses of the exhaustion-Stokes contradiction at79.1. This lemma provides the normalization and quantitative applicability, including78.1–80.1; it neither assumes nor proves a separate corner/gluing/virtual theory, and it changes no history labels, full Morse complex or relative homotopy sector.

Depends on

Used by

Dependency tree · two levels

33 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