Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (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.

Oppositely signed intersections of two three-manifolds in a simply connected six-manifold

Example

In S6 let A=S3⊂S6 be a standard linear 3-sphere and let B be a 3-sphere obtained from a standard 3-sphere disjoint from A by a finger move that pushes a small 3-ball across A; the move creates exactly two transverse intersection points p,q with opposite local signs, so A∩B={p,q} and I(A,B)=I(p)+I(q)=0. Here m=6, a=b=3, and a=b=m−3=3, so the clean-disk general-position lemma applies at its boundary, and S6 is simply connected, so every Whitney circle is null-homotopic; the high-dimensional Whitney trick then isotopes A to an embedded 3-sphere A′ with A′∩B=∅. The example thus verifies the dimension range a,b≤m−3 in the first non-trivial case and exhibits the cancellation of a single opposite-sign pair in a simply connected ambient manifold.

Facts & Assumptions

[F1]

Smooth embeddings. Smooth embeddings

[F2]

The local sign compares the ordered tangent spaces of the two sheets with the ambient orientation. The local oriented intersection sign

[F3]

The oriented intersection number. The oriented intersection number

[F4]

Sn is simply connected for every n≥2. Sn is simply connected for every n≥2

[F5]

In the stable range an admissible opposite-sign pair with nullhomotopic Whitney circle can be removed, leaving every other intersection fixed. The high-dimensional Whitney trick

Verification

Given: Countable choice and S6 as the one-point compactification of R6 with coordinates (e1,e2,e3,y1,y2,y3).

1.1givenconstructF1

Take A to be the compactification of the plane y=0, a standard linear S3. Start with a small round 3-sphere B0 in the affine 4-plane e2=e3=0, centred far enough in the positive y3 direction to miss A. Near its lowest point it is a graph y3=h0(e1,y1,y2)>0 over a small 3-ball. Replace only a smaller graph cap by y3=h1(e1,y1,y2), where h1=e12+y12+y22−ρ2 on a small inner ball and is positive outside it, agreeing with h0 near the outer cap boundary. Such a smooth radial interpolation can be chosen positive whenever e12+y12+y22>ρ2, by choosing ρ sufficiently small. The linear interpolation from h0 to h1 gives embedded graph caps throughout and fixes the outer collar; it is a local finger move of this 3-ball. The resulting B is an embedded S3.

2.1step 1.1constructalgebraF2F3

An intersection with A forces y1=y2=y3=0. On the changed cap it therefore forces e12=ρ2, giving exactly p=(ρ,0,0,0,0,0) and q=(−ρ,0,0,0,0,0). Outside the changed cap y3>0 wherever y1=y2=0, so there are no other intersections. At either point the tangent directions of B are ∂e1+2e1∂y3,∂y1,∂y2. Together with TA=span⁡(∂e1,∂e2,∂e3) they span the six-dimensional ambient space; their determinant differs at the two points only by the sign of 2e1. Thus the local signs are opposite and I(A,B)=0.

3.1step 2.1constructF4F5∎

Here a=b=3=m−3, so the stable dimension inequalities are met at equality. The sphere S6 is simply connected by the published sphere theorem, and the two connected sheets admit the required avoiding arcs. The high-dimensional Whitney trick therefore removes exactly this pair, producing an embedded A′ disjoint from B. The explicit cap verifies the claimed finger-move witness, rather than presupposing its intersection count.

Depends on

Used by

Nothing in the library uses this result yet.

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