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

Smoothness of continuous weak almost complex strip solutions

Statement

Assume Countable Choice. Let G be a disk or an upper half-disk in R2, let Ω⊂R2m be open, and let J(s,t,x) be smooth, including the straight source boundary in the half-disk case, with J2=−I. Let u:G→Ω be continuous, belong locally to W1,2, and satisfy us+J(s,t,u)ut=0 weakly. In the half-disk case assume continuity and local W1,2 also up to the straight boundary, u(s,0)∈Rm⊂Cm=R2m, and Rm∩J(s,0,u(s,0))Rm={0}. Then u is smooth locally, including all one-sided derivatives at the straight boundary. Thus a continuous W1,2 weak solution in smooth target charts with a flattened totally real boundary has classical smooth regularity. Continuity at a missing puncture is a premise, not a conclusion.

Facts & Assumptions

Given: The equation, local continuity and finite Sobolev norm, smooth coefficients, and totally real boundary condition in the statement.

[F1]

Under Countable Choice, Weak Lp regularity for a small Cauchy–Riemann principal perturbation gives W1,p regularity and a derivative estimate for compactly supported W1,2 solutions of D0w=Awt+f, with ∥A∥∞≤ηm,p and f∈L2∩Lp. It applies on the half-plane when w is continuous with real boundary values, and applies locally by real cutoffs.

[F2]

The actual Countable Choice proofs in The difference-quotient characterisation of W1,p for 1<p<∞ give uniform tangential quotient bounds from a weak tangential derivative, including on half-domains. Conversely, Uniformly bounded difference quotients represent a weak derivative turns such bounds into weak derivatives without weak compactness.

[F3]

The Countable Choice proof in Planar Sobolev continuity estimates under Countable Choice gives local W1,p⊂C0,1−2/p and W2,p⊂C1,1−2/p for p>2, including straight boundaries.

Proof

1.1givenconstructalgebra

Work near one source point z0. A constant real target change makes J(z0,u(z0))=i. At an interior point choose a real basis e1,Je1,…,em,Jem successively in this finite-dimensional complex vector space. At a boundary point take a real basis e1,…,em of the boundary plane; total reality makes e1,…,em,Je1,…,Jem a basis, and the change sending these vectors to the standard real and imaginary bases preserves the real boundary plane. Continuity of u and smoothness of J then give a disk or half-disk on which A(s,t)=i−J(s,t,u(s,t)),∥A∥∞<min⁡{ηm,8,ηm,4}. The equation becomes D0u=Aut. After further shrinking its image is in a compact subset of a convex target coordinate ball. All smooth coefficient derivatives are bounded there. Real cutoffs preserve the boundary condition.

2.1F2step 1.1constructalgebra

We record the weak calculus used below. For a continuous W1,q map, the chain rule ∂jH(z,u)=Hzj(z,u)+Hx(z,u)∂ju holds for a smooth H with bounded derivatives on its localized image. Indeed, on interior compact subsets mollify u: uniform convergence follows from continuity, convergence of derivatives holds in Lq, and the classical chain rule passes to distributions by boundedness and uniform convergence of the coefficient derivatives. This gives the formula everywhere in the open half-domain too; its bounds extend to the boundary because the formula has an integrable right side on the full half-domain. The product rule follows by the same argument whenever one factor and the relevant lower derivatives are bounded, or by Holder when the two differentiated factors have conjugate product integrability. Higher chain and product formulas follow inductively once the corresponding lower derivatives have these bounds. Difference quotients obey δs(fg)=f(s+h,t)δsg+(δsf)g, and [F2] bounds the quotients by the weak derivatives on a slightly larger patch. These arguments use countably many mollifications and no selection of weakly convergent subsequences.

3.1F1F2step 1.1step 2.1constructalgebra

Apply [F1] with p=8 to a real-cutoff localization of u. Its forcing is (χs+iχt−Aχt)u, which is bounded and compactly supported because u is continuous. The localized map is already W1,2, and is continuous and real on the physical boundary. Thus u∈W1,8 on a smaller patch. Step 2.1 implies A∈W1,8 there. For each sufficiently small nonzero tangential shift h, put vh=δsu and Ah(s,t)=A(s+h,t). Subtracting the equations gives D0vh=Ah(vh)t+(δsA)ut. The last term has a uniform L4 bound by Holder and [F2], since its factors have uniformly bounded L8 norms. The local L4 norm of vh is uniformly bounded by the tangential quotient estimate. Each vh separately is continuous, real on the boundary, and W1,2: it is a difference of translates of a W1,8 map divided by a fixed nonzero number. Therefore [F1] with p=4 and a fixed cutoff gives uniform L4 bounds for (vh)s,(vh)t on a still smaller patch; all forcing terms, including cutoff terms, lie in L4∩L2 by finite support.

4.1F2F3step 2.1step 3.1algebra

Apply the converse in [F2] to us and ut, whose tangential quotients are the uniformly bounded derivatives of vh. It follows that uss,ust∈L4. The original equation equivalently says ut=J(s,t,u)us, since J2=−I. Differentiate this weakly in t using step 2.1: utt=(Jt+Jxut)us+Just. Here Jt denotes its explicit source derivative. Both first derivatives of u are in L8, so the product term lies in L4; the other terms do too. Thus u∈W2,4 locally. By [F3], u is now C1,1/2 on smaller patches up to the physical boundary, with bounded first derivatives. In particular its classical tangential boundary derivative is real.

5.1F3step 2.1step 4.1constructalgebra

Suppose inductively u∈Wk,4 locally for an integer k≥2. By [F3] applied to its derivatives of order at most k−2, all derivatives of order at most k−1 have continuous bounded representatives on smaller patches. Repeated use of step 2.1 gives A∈Wk,4, with all its derivatives of order at most k−1 bounded. Put v=∂sk−1u. Its differentiated equation is D0v=Avt+G,G=∑a=1k−1(k−1a)(∂saA)(∂t∂sk−1−au). The function G and its weak s derivative lie in L4: in a differentiated product at most one factor has order k, which is L4; every other factor has order at most k−1 and is bounded. The same reasoning applies to the chain expansion for A, since a term containing a derivative of order k contains it only once. The function v is continuous, belongs to W1,4, and has real boundary values, being the tangential derivative of order k−1 of a Ck−1 map whose boundary trace is real.

6.1F1F2step 5.1constructalgebra

Take tangential quotients of the last equation: D0(δsv)=Ah∂t(δsv)+(δsA)vt+δsG. The quotient forcing is uniformly L4 on smaller patches: δsA is uniformly bounded by the bounded classical first derivative of A, vt∈L4, and δsG is controlled by Gs∈L4 and [F2]. Also δsv is uniformly L4 by vs∈L4. For each fixed h it is continuous, real on the boundary, and W1,2 on bounded patches, so [F1] and cutoffs give uniform L4 bounds for its first derivatives. The converse in [F2] gives ∂sk+1u,∂t∂sku∈L4. This supplies the derivatives of total order k+1 with zero or one normal derivative.

7.1step 2.1step 5.1step 6.1algebra

Recover the other derivatives from ut=Jus. For a derivative of total order k+1 with b≥2 normal derivatives, apply ∂sk+1−b∂tb−1 to this equation. The term in which no derivative hits J is J∂sk+2−b∂tb−1u, already known by induction on b. In every other product, derivatives of u have order at most k, and differentiated coefficient factors have order at most k. If a factor has order k, it is the only such factor and all others are bounded; otherwise all factors are bounded. Thus all these terms lie in L4 on a bounded smaller patch. For precision, first differentiate the equation only k−1 times, by ∂sk+1−b∂tb−2, and then take one more weak t derivative. The highest differentiated us factor has a known weak t derivative by the induction on b; its coefficient J is C1, so the ordinary first-order weak product rule applies. All other factors have the bounded or L4 derivatives just described. This justifies the displayed expansion without multiplying an undefined high-order distribution by a nonsmooth coefficient, and proves the desired derivative exists in L4. Induction on b proves u∈Wk+1,4.

8.1F3step 4.1step 5.1step 6.1step 7.1construct∎

Starting with step 4.1, steps 5.1 through 7.1 prove local Wk,4 for every finite k, using nested patches inside the original coordinate neighborhood. To obtain a fixed neighborhood for any specified order, choose its finitely many nested patches between that neighborhood and a larger one; no uniform positive loss after infinitely many inductions is needed. Applying [F3] to each derivative then gives classical derivatives of every order, with their continuous extensions to the straight boundary and the usual tangential boundary derivatives. The given continuous representative agrees with each Sobolev representative. The equation therefore holds classically and u is smooth as asserted. This conclusion requires the initial continuity premise and does not establish it at any puncture.

Remarks

The earlier bibliography named Dusa McDuff and Dietmar Salamon, J-holomorphic Curves and Symplectic Topology, elliptic regularity (https://bookstore.ams.org/coll-52). The cited book full text was not available in this review; no reading of that edition is asserted. The current reference records the actually read alternate context, while the complete local proof above carries the stated claim.

Depends on

Used by

Dependency tree · two levels

37 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