Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

A controlled nested horn construction embeds a closed three-ball

Statement

Assume AC. The marked replacement of A horn replacement block has an injective commutator meridian can be iterated inside a compact standard unknotted solid torus X0R3, with diamX01, to give decreasing compact sets Xn, increasing parametrized closed 3-balls BnXn, and a homeomorphism f:DB=n0Xn, where D={(u,z)R2×R:u2+z21, z0}. Moreover intB=f(intD) and B=f(D)S2.

The construction retains the actual marked replacement blocks and meridional pillboxes Cs indexed by finite binary words. For nonempty s, diamCs<2s, and the child solid-torus envelopes satisfy diamTs2(s1). Every complementary piece is obtained by removing the relative interior in its torus of its pillbox, with precisely two cap disks as intersection. At every finite replacement the two-sided annular collar and transported meridians satisfy the insertion hypotheses of the cited lemma, apart from the explicitly separate algebraic hypothesis that the parent meridian is a member of a free exterior basis.

There are actual finite homeomorphisms fm:DBm and continuous maps qn:XnD such that, for mn1, fmfn2(n1),qn(fm(x))xdn=28n. A number δn>0 extracted below from the finite compact data Xn,qn satisfies fm(x)fm(y)<δn  xy<3dn, and the same implication holds for f. Thus the asserted embedding includes inverse control; uniform convergence alone is not its justification. AC is used to select compatible finite maps recursively and through invariance of domain for the interior and boundary assertions.

Facts & Assumptions

[F1]

A horn replacement block has an injective commutator meridian supplies the explicitly parametrized ball block, its cap-and-side marking, two child tori, collared punctured-torus complement and arbitrarily small prepared future slices with disjoint ambient neighborhoods. We use its geometric clauses, not its conditional free-group conclusion to infer any embedding.

[F4]

A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value gives an attained positive minimum when a continuous strictly positive function is defined on a nonempty compact metric space.

[F5]

Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on [a,b] takes every value between f(a) and f(b) implies that a continuous injective function on an interval is strictly monotone: a value strictly between a local high or low value and both flanking values would otherwise have two preimages. This applies to the cut-open circle maps below.

[F6]

Invariance of domain states, under AC, that a continuous injective map from an open subset of Rk into Rk is open.

[F7]

The Axiom of Choice is assumed. For the recursive map selections we apply a choice function to the set of nonempty sets of permitted next finite data, then use ordinary recursion. This covers dependent successive choices, not just a pre-existing list of independently selectable maps.

Proof

Given: Work in Euclidean coordinates for the construction and in supplied ball parametrizations for cap maps. A cap map below is a homeomorphism of disk pairs, including their boundary circles. The only configurations to be matched have two or three disjoint labelled caps with larger disk charts in their boundary spheres; those charts are C1 with nonsingular derivative near their centers. We first prove the restricted matching assertion that will be used.

1.1

In a parametrized boundary sphere choose a point outside all cap neighborhoods and use stereographic coordinates. For each cap take a chart c:D22S2 whose unit disk is the cap. Such charts may be rescaled so their images are disjoint. A strictly increasing piecewise-linear function of radius, taking 1 to λ>0 and fixing 2, extends by the identity to a sphere homeomorphism and shrinks the cap to c(Dλ2). Its inverse uses the inverse radial function. Center the planar chart at zero. Its derivative L is invertible; reverse an input axis if necessary so detL>0. Normalize by L1. For small r, the normalized map g has g(0)=0, Dg(0)=I and Lip(gid)ϵ on the disk of radius 2r, by [F2]. With the radial cutoff χ=1 on radius r, linear down to zero on radius 2r, the extension k=χ(gid), zero elsewhere, has Lipschitz constant at most 3ϵ. For a segment crossing the support boundary, use its first boundary point to obtain the same estimate. Choose 3ϵ<1/2. Then H=id+k is injective since H(x)H(y)(13ϵ)xy, and onto since xbk(x) has a fixed point in complete R2 for every b. Its inverse is Lipschitz. After conjugating by L, this gives a homeomorphism supported in the chosen cap neighborhood taking a small ellipse L(Dλ2) to the small cap.

F2given
1.2

Start with a compact standard unknotted torus X0 scaled to diameter at most one. One explicit choice is the image under stereographic projection of {za}S3C2, 0<a<1, with the omitted point chosen in its exterior, followed by a Euclidean dilation. Its disk-times-circle coordinates are those of [F1]. Choose a proper closed core arc and its meridional slice C; its relative complement B0=X0intX0C is a cylinder ball meeting it in precisely its two caps. In a prepared Cs, insert [F1]'s block using its entire cap-and-side boundary marking, extended through the already parametrized balls as in that lemma. Apply its small-slice preparation with η=2(s+1). This gives disjoint child tori Ts0,Ts1Cs and slices CsiTsi in disjoint closed neighborhoods in intCs, away from incoming caps. Set Psi=TsiintTsiCsi. Each is a parametrized cylinder ball. The construction fixes all previous pieces and cap maps. Apply [F7] to choose the permitted finite outputs recursively on word length, with lexicographic order within a level.

F1F7given
1.3

In the fixed source D, let c=0, ρ=1, and recursively cs0=cs(ρs/2,0),cs1=cs+(ρs/2,0),ρsi=ρs/8. Let Rs={(u,z):z0, ucs2+z2ρs2}, Qs={ucsρs}, hs(u)=ρs2ucs2, and Ss={(u,hs(u)):uQs}. Use R=D. The children are disjoint closed half-balls: their centers are distance ρs apart and the sum of their radii is ρs/4. They stay below the parent hemisphere since every child point is at distance at most 5ρs/8<ρs from the parent center. Thus Un=s=nRs decreases, its constituent diameters are dn=28n, and nUn lies in the flat boundary z=0. The upper half-ball D is itself a parametrized closed ball: radial projection from an interior point identifies this compact convex body with a round ball. Along each ray the exit distance is the positive minimum of the plane and sphere exit distances when both exist; these formulas fit continuously where the active exit changes and are bounded away from zero.

givenalgebra
2.1

An ellipse can itself be changed to a round disk within that neighborhood. Gram–Schmidt on the two columns writes L=QR, where Q is a rotation and R is upper triangular with positive diagonal; the latter is a positive diagonal times a shear. Interpolating the rotation angle, positive diagonal entries and shear entry gives a continuous path of invertible positive-determinant matrices from I to L. Their norms and inverse norms are bounded on the compact parameter interval by [F3] and [F4]. A sufficiently fine finite subdivision makes every successive quotient matrix A close to I. On a fixed small neighborhood, xx+χ(x)(AI)x then has perturbation Lipschitz constant less than 1/2 and is a homeomorphism by the proof of step 1.1. Choose the initial disk sufficiently small that all intermediate ellipses stay where χ=1; the finite composition is exactly L there. Its inverse rounds the ellipse. Together with the inverse of the last map in step 1.1 this rounds the small cap, with all supports missing other caps.

F3F4step 1.1
2.2

The exact output relations are Ts0Ts1=, TsiCs equal to its one incoming disk, and PsCs equal to its two outgoing disks. These are literal relative-interior cuts in the recorded product coordinates, not removal of ambient interiors. Also diamCs<2s for s, and TsCs gives diamTs2(s1), with the depth-one bound coming from X0. Define for n1 Bn=B01snPs,Xn=Bn1s=nTs. The depth-n tori are disjoint and meet Bn1 only in their individual incoming disks. This follows by induction from disjoint siblings and from all subsequent slices lying away from earlier caps. Substitution of Ts=PsCs gives Xn=Bns=nCs, Xn+1Xn, and BnBn+1Xn+1. Finite unions are compact by [F3]. Every point of Xn lies in Bn or in one of its attached Cs, which has a cap in Bn. Therefore dist(y,Bn)2n for all yXn. No ball-recognition conclusion for Bn has yet been assumed.

F3step 1.2
2.3

Put As=Rs(intDRs0intDRs1), including s=. Extend the child height functions by zero, and put gs=max(hs0,hs1) on Qs. Then As={(u,z):gs(u)zhs(u)} and js(u,z)=(u,gs(u)+(1gs(u)/hs(u))z) for uintQs, with identity at the rim, is a homeomorphism RsAs fixing Ss. Indeed gs=0 near that rim, and gs<hs on its compact support by step 1.3. The fiber maps are strictly increasing affine bijections, whose inverses subtract gs and divide by 1gs/hs. That denominator is bounded positively away from zero on the support by [F4], and it equals one near the rim; hence both maps are continuous everywhere. Under js1 the outgoing hemispheres are the two flat disks Qs0,Qs1. More generally An=Ds=n+1intDRs is the union of A and all As through depth n, with just the parent-child hemisphere intersections. Applying the same vertical formula to the maximum of the depth-n+1 heights proves it is a ball.

F4step 1.3
3.1

Finite labelled configurations of disjoint round planar disks can be matched by supported homeomorphisms. For one disk, join its center to a vacant destination by a polygonal path avoiding the protected disks: replace portions of a straight segment inside each protected disk by detours in slightly larger disjoint concentric annuli, and approximate the finitely many circular arcs by polygonal arcs in those annuli. The compact resulting path has positive distance from the protected disks by [F4]. Shrink the moving disk below one tenth of this clearance. For each sufficiently small displacement v along a finite subdivision, use xx+χ(x)v, with χ=1 near that disk and supported in a clearance ball. The bound vLipχ<1/2 proves invertibility as in step 1.1 and makes the disk move by exactly v. Expand it radially at its destination when the intended final disk neighborhood is free. First move every disk to disjoint temporary disks far outside both configurations; then move to the final disks one by one. Shrinking before motion avoids all occupied disks. Thus no coincident occupied destination is assumed free. This proves labelled setwise matching on the sphere after step 2.1.

F4step 1.1step 2.1
4.1

The matching can have either sign on each boundary circle, with the same global sign. Indeed first match the labelled disks to disks centered on one axis; reflection across that axis preserves every label and reverses each circle, and conjugate it back. Now suppose the whole map on one cap is prescribed. Compare it with a chosen setwise matching, choosing the latter's sign so the required correction k:D2D2 has orientation-preserving boundary map b. This means its circle lift has positive increment, as follows directly without a disk classification theorem. Cut domain and target circles at a point and its image. The induced homeomorphism of open intervals is strictly increasing or decreasing by [F5]. In the increasing case its endpoint limits give a lift β:[0,2π]R with β(2π)=β(0)+2π; extend by this translation to all real arguments. In the decreasing case the increment is 2π, which reflection reverses. For the increasing correction, βs(t)=(1s)β(t)+st is strictly increasing, continuous, and obeys βs(t+2π)=βs(t)+2π for 0s1. Hence it defines a circle homeomorphism. Use k on the unit disk, and (r,eit)(r,eiβr1(t)) on its collar 1r2. At radius one the maps agree; at radius two it is the identity. The collar map is a continuous bijection of a compact annulus, so its inverse is continuous by [F3]. Extending by the identity fixes all other caps. Finally a sphere homeomorphism b0 extends through a parametrized ball by tutb0(u) and zero mapping to zero, with the analogous inverse. Thus two- or three-cap balls can be matched with an exact prescribed incoming disk map.

F3F5step 3.1
5.1

Verify the cap hypotheses of step 4.1 in these particular parametrizations. For PsD2×[0,1], the outgoing caps are its end disks. Extend their disk charts across the rims down the side. The incoming disk is the angular rectangular patch on that side from [F1], away from the removed slice; it has a slightly larger angular chart. A rectangle is parametrized by a disk using an increasing radial adjustment that is the identity near the center, so the chart has nonsingular smooth derivative there. Radial parametrization of the cylinder by a round ball is smooth near the centers of its end and side faces. No smoothness is required at its edges. On the source side, js identifies the outgoing caps with disks strictly inside a flat face; the incoming hemisphere has a disk chart smooth near its pole, extended across its rim into the adjacent flat annulus. Such a chart can use polar angular coordinates from the pole and continue its radial parameter past the equator into the flat face. All these extensions miss the other caps. Transport by the already specified abstract ball parametrizations retains these chart properties even when the ambient image is no longer smooth. Consequently choose h:AB0 matching the two outgoing caps. Inductively step 4.1 gives hs:AsPs extending the exact map already prescribed by its parent's outgoing cap, and matching its two outgoing caps.

F1step 4.1step 1.2step 2.3
6.1

Use [F7] for this recursive selection of compatible hs. Finite closed pasting gives hn:AnBn: each finite piece map is continuous, their maps agree on caps, and the only intersections on either side are those same caps. Hence the pasted map is a bijection. Continuity follows because the preimage of a closed set is the finite union of its closed preimages in the closed pieces. Compactness and [F3] make this bijection a homeomorphism. For n1 define fn:DBn by hn1 on An1 and hsjs on each depth-n half-ball Rs. The pieces agree on Ss, since js fixes it. The same finite-pasting and intersection argument proves fn a homeomorphism onto Bn. One may set f0=hj. Every finite embedding has now been proved before taking a limit.

F3F7step 2.2step 2.3step 5.1
7.1

For mn1, fm=fn off Un, and fm(Rs)Ts for every s=n. Indeed all descendant target pieces and terminal approximations lie within that parent envelope, while earlier source pieces have already fixed maps. Further, fn(DUn) misses all depth-n tori: their intersections with the old body are incoming disks, whose entire preimages Ss already lie in Rs. These assertions include every shared cap point. Consequently the diameter bound in step 2.2 gives fmfn2(n1). This uses the full torus envelopes, not an unjustified confinement of an unfinished source half-ball to its next slice.

step 2.2step 6.1
7.2

Construct a continuous qn:XnD agreeing with (hn1)1 on Bn1 and sending each depth-n torus Ts into Rs. The incoming disk of Ts has an extended product neighborhood D22×[0,1] inside the torus, with cap D12×{0}. This comes from the angular side chart and inward radial coordinate of the template torus, transported by all finite maps; the extension past the cap rim misses other attachments. Let bs:D12Ss be the prescribed inverse cap map and as=(cs,0). Put v(u)=u/max(1,u), w(r)=1 for r1 and w(r)=2r for 1r2, and α(u,t)=w(u)(1t). On this neighborhood set qn(u,t)=α(u,t)bs(v(u))+(1α(u,t))as; elsewhere in Ts set qn=as. On u=2 or t=1 these formulas agree; at t=0, u1 they give the required inverse cap map. The convexity of Rs keeps the values inside it. Finite closed pasting, with the fixed inverse on Bn1, proves continuity on Xn. No extension over the entire boundary of a solid torus is being presumed.

step 1.2step 1.3step 5.1step 6.1
8.1

For mn, step 7.1 and the definitions give qn(fm(x))xdn: it is zero off Un, and otherwise both points lie in the same half-ball Rs. Define the closed subset Mn={(u,v)Xn2:qn(u)qn(v)dn}. The set Xn2 is compact as a closed bounded subset of R6, by [F3], so Mn is compact. If it is empty set δn=1. Otherwise let δn be half the minimum of uv on Mn, attained by [F4]. This minimum is positive because u=v would force 0dn>0. Thus for all u,vXn, uv<δn implies qn(u)qn(v)<dn. Combining this with the two error bounds yields the claimed strict inequality xy<3dn whenever fm(x)fm(y)<δn.

F3F4step 7.1step 7.2
9.1

Step 7.1 makes (fn(x)) Cauchy for every x; [F2] supplies its limit f(x), with uniform error ffn2(n1). For any ϵ>0, choose n with twice this error below 2ϵ/3 and use continuity of fn at x with error ϵ/3. The triangle inequality proves continuity of f. For each fixed n, all later images lie in the closed Xn, so f(D)B=nXn. By continuity of qn, the estimate qn(fm(x))xdn passes to the limit. Applying the modulus of qn just established in step 8.1 directly to f(x),f(y) gives f(x)f(y)<δnxy<3dn. This does not pass a strict inequality through a limit. If xy, choose n with 3dn<xy; equality f(x)=f(y) contradicts that implication. Hence f is injective.

F2step 2.2step 7.1step 8.1
10.1

If yB, then step 2.2 gives dist(y,Bn)2n. Since fn is onto Bn, the uniform error gives dist(y,f(D))2n+2(n1). More explicitly choose a point of Bn within 2n+ϵ of y and its preimage under fn, then let ϵ0. The right side tends to zero. The compact image f(D) is closed by [F3], so yf(D). We already have the reverse inclusion, hence f(D)=B. By [F3], or directly the modulus in step 9.1, f is a homeomorphism. In particular B is nonempty; no invocation of an empty-set minimum or of an unproved limit-embedding assertion has occurred.

F3step 2.2step 6.1step 9.1
11.1

Apply [F6] to fintD, whose domain is open in R3, to obtain f(intD)intB. Conversely suppose f(x)intB with xD. Choose an ambient open ball V around f(x) contained in B. The continuous injective inverse f1:VR3 would have open image by [F6], contained in D and containing its boundary point x. This is impossible by the defining Euclidean boundary of D. Thus intB=f(intD), and, since B is closed, B=BintB=f(D)S2. The radial parametrization in step 1.3 identifies that boundary sphere. This is precisely the inherited AC use of invariance of domain; it was not used to assert the earlier finite maps were embeddings.

F6step 1.3step 10.1
12.1

Finally check the claimed geometric insertion data throughout this actual recursion. In the extended coordinates of a meridional slice, increasing its disk radius gives an outward side collar outside the old torus. The transported block of [F1] gives an inward collar after replacement. Their annulus parameters agree by the prescribed whole boundary marking, so together they are a two-sided product collar. At each cap end reduce its positive width continuously to avoid the closed cap; the open side is parametrized by the circle and the open core interval. Prepared supports have disjoint closed neighborhoods inside their parent and miss all earlier pieces, so this collar misses the remainder Y of the old body, which meets the slice exactly in its two caps. Process each finite level lexicographically. Old meridians and whiskers in the exterior avoid every remaining closed slice; retain them, and use the transported template meridians and whiskers for new children. The preparation transports those same loops to the future meridional-slice coordinates, fixing the parent boundary. Thus no unrecorded path conjugation or arbitrary replacement picture enters the recursion. If an old exterior is path connected, [F1]'s collared open cover also proves the new exterior is path connected; its algebraic injection still requires the stated free-basis hypothesis, to be checked when used. All scales are positive, js fixes every incoming endpoint, and the compression fixes support boundaries. AC was used exactly in steps 1.2 and 6.1 for recursive selections and in step 11.1 through [F6]; the finite matching, inverse formulas and metric estimates add no choice principle. This proves all assertions.

F1F7step 1.2step 2.2step 5.1step 6.1step 8.1step 11.1

Depends on

Used by

Dependency tree · two levels

96 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