Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (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.

Smooth Jordan disks and extension of prescribed boundary collars

Statement

Assume the Axiom of Countable Choice. The bounded region of a smooth embedded circle in the oriented plane, together with its boundary, is a smooth manifold with boundary diffeomorphic to the closed standard disk. Let D0,D1 be two such closed regions. Every orientation-preserving smooth boundary diffeomorphism b:∂D0→∂D1 extends to an orientation-preserving diffeomorphism B:D0→D1. More precisely, for specified smooth inward collars ci:∂Di×[0,ϵ)→Di with ci(p,0)=p, the extension may be required to satisfy B(c0(p,r))=c1(b(p),r) for every sufficiently small r≥0. In addition, given interior points pi∈Di and an orientation-preserving smooth diffeomorphism q from a neighborhood of p0 onto a neighborhood of p1, the extension can agree with q near p0 while retaining the prescribed boundary collars.

Facts & Assumptions

Given: Countable Choice, smooth embedded circles in the plane, and the boundary map and collars in the statement.

[A1]

The Axiom of Countable Choice (ACω) is assumed. Only the smooth disk-attachment and isotopy-extension suppliers below use it; every geometric selection in this proof is finite.

[F1]

A smooth map with invertible derivative is a local diffeomorphism, without a choice hypothesis (Choice-free smooth inverse function theorem in Euclidean space).

[F2]

A simple polygon has exactly one bounded complementary region and one unbounded complementary region, with the polygon as the frontier of both (Polygonal Jordan curve theorem: a polygon has exactly two complementary regions and is the frontier of each).

[F3]

A simple polygonal region has a finite straight triangulation (Every simple polygon admits a triangulation), and a connected finite plane graph has V−E+F=2 (Euler's formula ∣V∣−∣E∣+∣F∣=2 for every connected plane graph).

[F4]

Under Countable Choice, attaching a standard smooth disk along an embedded boundary disk, with the corner rounded, preserves the diffeomorphism type (Boundary connected sum with a disk does not change the diffeomorphism type).

[F5]

Under Countable Choice, an isotopy of embeddings of a compact smooth manifold with boundary into a boundaryless manifold of the same dimension, constant near the two time endpoints, extends to a smooth ambient isotopy supported in any specified neighborhood of its track (Isotopy extension for a compact source with boundary).

Proof

1.1F1givenconstruct

Parametrize the circle by a smooth regular embedding γ:S1→R2, and let n be its smooth unit normal obtained by rotating and normalizing its tangent. The map T(s,r)=γ(s)+rn(s) has invertible derivative at r=0. By [F1] and compactness it is a local diffeomorphism on a common strip ∣r∣<a. It is injective after shrinking a: otherwise collisions for widths tending to zero would have a subsequence of their circle parameters converging; equality of the limiting images and injectivity of γ give the same limiting parameter, contrary to a local inverse there. Thus T is a smooth two-sided annular coordinate.

1.2F2F3construct

We prove that a rounded polygonal region is a smooth disk. Take the finite triangulation in [F3]. The dual adjacency graph of its triangles, with an exterior root adjacent across every boundary edge, is connected. Indeed the triangles at any one vertex form a consecutive cyclic fan or a consecutive interval fan, so all their sectors are joined through shared edges, and connectedness of the triangulated region joins all fans. Choose a finite spanning tree of this dual graph rooted at the exterior. Process triangles in increasing distance from that root. Remove each triangle and its edge toward its parent: this edge is free, since its only other incident triangle has already been removed or is exterior. Removing a triangle with its free side leaves its two other sides and vertices, preserves connectedness, and preserves V−E+F. Plane Euler in [F3], with the exterior counted as one extra face, gives initial value V−E+F=1. At the end the remaining connected graph K therefore has V−E=1, so it is a tree: a spanning tree already has V−1 edges, leaving no edge outside that spanning tree.

2.1F1F2step 1.1construct

Inscribe a polygon with a sufficiently fine cyclic mesh in γ. Uniform continuity of γ′ gives positive scalar product of each chord direction with the tangent at every nearby normal projection, and the chord error tends uniformly to zero. Hence the normal projection of each chord is strictly increasing in its cyclic coordinate; the whole polygon has degree one under normal projection and is a normal graph. In particular it is embedded. Smooth its finitely many corners in disjoint small graph charts: convolution of the local graph function with a smooth compactly supported kernel on a smaller interval, joined by a smooth cutoff on a larger interval, leaves it unchanged outside that chart and can be made arbitrarily small in height and tangent direction. The smoothed curve P′ is still a normal graph r=f(s), with f smooth and arbitrarily small. Choose a smooth cutoff χ supported in (−a,a) and equal to one near zero. For ∥f∥∞∥χ′∥∞<1, the map (s,r)↦(s,r+χ(r)f(s)) is a diffeomorphism, because its normal derivative is positive, and equals the identity near the ends of the strip. It extends by the identity to a smooth plane diffeomorphism carrying γ onto the rounded polygon P′. The same graph construction compares any two sufficiently small choices of corner rounding. By [F2], the polygon has bounded and unbounded regions; rounding preserves them by local graph homeomorphisms: in a graph chart, a continuous vertical displacement, cut off in the transverse direction with positive transverse derivative, carries the original piecewise affine graph to the rounded graph, and transporting them by the displayed plane diffeomorphism proves the corresponding separation and smooth boundary charts for γ.

3.1A1F4step 2.1step 1.2construct

Realize these finite collapses on smooth rounded neighborhoods. In affine coordinates on a triangle whose free side is to be removed, retain thin strips along its other two sides and a rounded disk at their common vertex. The missing sector can be chosen as a convex triangle with its corners rounded. Its attaching part runs along the inner sides of the two retained strips, joined around their common vertex, and is one boundary interval. Near the other two vertices use disjoint vertex disks and the corresponding short collar intervals; outside this triangle the neighborhood is unchanged. No other simplex meets its open interior. These choices give compatible rounded neighborhoods before and after the collapse whose difference is one smooth disk attached along one embedded boundary interval. To check that this added piece is a standard disk, a convex rounded triangle has a positive smooth radial boundary function a(θ) about any interior center. On the standard disk the radial map r↦rexp⁡(η(log⁡r)log⁡a(θ)) is smooth and linear near zero when η=0 there, agrees with r↦ra(θ) near r=1 when η=1 there, and has positive radial derivative if ∣η′∣ ∥log⁡a∥∞<1; choose its transition over a sufficiently long interval of log⁡r. Thus it is a disk parametrization. The corner models match the retained strip collars before [F4] is applied. Consequently each collapse preserves the smooth diffeomorphism type of the rounded neighborhood. A rounded neighborhood of the final tree is a disk: remove a leaf disk and its band successively, each a disk attached along one interval, until one vertex disk remains. Applying [F4] finitely often proves the assertion for the initial rounded polygon. Step 2.1 then proves it for the original smooth circle.

4.1step 3.1construct

Choose orientation-preserving disk parametrizations pi:B‾(0,1)→Di. The boundary map p1−1bp0 has a smooth increasing angular lift g:R→R, with g(θ+2π)=g(θ)+2π. Let ρ(r) be smooth, zero near zero and one near one. The map (r,θ)↦(r,θ+ρ(r)(g(θ)−θ)) is the identity near the center and has angular derivative 1+ρ(r)(g′(θ)−1)>0. It is consequently a smooth disk diffeomorphism extending the boundary map, and is a product in the radial collars. Conjugate by p0,p1 to obtain a preliminary extension.

5.1F1F5step 1.1step 4.1construct

We can replace either radial collar by its prescribed collar without changing the boundary. More generally, express two collars with the same boundary parametrization in the normal coordinates of step 1.1. Their relative coordinate map is (s,r)↦(S(s,r),R(s,r)), where S(s,0)=s, R(s,0)=0, and ∂rR(s,0)>0. Use the periodic lift of S−s and interpolate to the identity by (s+u(S−s),(1−u)r+uR) for 0≤u≤1. At r=0 the Jacobian is triangular with positive diagonal entries 1,(1−u)+u∂rR(s,0). Smooth collar maps extend across r=0 in the normal chart, by their local smooth-extension convention and finitely many chart cutoffs. Compactness and the local-inverse and separation argument of step 1.1 give a common narrow two-sided closed annulus on which every interpolated map is an embedding. Reparametrize u smoothly to be constant near its endpoints. Apply [F5] to this compact two-dimensional annulus and the ambient plane, with support in a thin boundary neighborhood. The prescribed isotopy fixes its middle circle, so its ambient extension fixes every boundary point and preserves the bounded side. Its final diffeomorphism identifies the two collar germs exactly. Perform this correction on both sides of the preliminary extension of step 4.1. The resulting extension agrees with c0(p,r)↦c1(b(p),r) on a common smaller collar. Its smooth inverse and orientation follow from the same properties of all the factors.

6.1A1F1F5step 1.1step 3.1step 5.1construct∎

For the interior prescription, first move B(p0) to p1 by a diffeomorphism supported in int⁡D1. A smooth path exists there by the disk parametrization of step 3.1. Cover it by finitely many interior coordinate balls and subdivide it so each successive pair lies in one smaller convex coordinate ball. For each pair, translation of a sufficiently small closed coordinate disk along their segment is an isotopy of full-dimensional disk embeddings whose track lies in that ball. Apply [F5], with a time parameter constant near its ends, and compose the resulting supported ambient diffeomorphisms. This moves the point as stated and leaves a neighborhood of the boundary fixed. Rename the resulting extension B. The germ k=q∘B−1 at p1 fixes p1 and preserves orientation. In centered coordinates its rescalings kt(x)=k(tx)/t for t>0 extend smoothly at t=0 to Ax, where A=Dk(0), since k(tx)/t=∫01Dk(stx)x ds. Each positive linear matrix A is smoothly joined to the identity: write A=RP with P positive definite and R a rotation, interpolate P linearly to the identity and the rotation angle linearly to zero. Concatenate the resulting path from the identity to A with kt from A to k, and make the time parameter constant near the endpoints and all joins. On one common sufficiently small closed disk all slices are embeddings with track in an interior coordinate ball, by compactness and the inverse-function and separation argument of step 1.1. [F5] extends this disk isotopy to an ambient isotopy supported in that ball. Its terminal map K agrees with k near p1, so K∘B=q near p0. The boundary collars stay fixed. Only [F4] and [F5] use Countable Choice; all selections and compositions are finite.

Depends on

Used by

Dependency tree · two levels

55 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