Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

A local Whitney move in Euclidean space

Example

Assume ACω for the compact-support flow supplier. In R2 let C0={(u,0):u∈R}⊂R2 and let C1 be the graph of a smooth function that crosses the u-axis transversely in exactly two points p,q with opposite local signs (the standard picture: a curve crossing the axis once upward and once downward, bounding with the axis segment between p and q a disk D). Then the local Whitney move of The local Whitney move is an ambient isotopy Gt of R2 supported in a neighbourhood of D which leaves C0 fixed outside a slightly extended segment containing p and q, sweeps that segment across D, and produces an arc C0′ with C0′∩C1=∅; the two intersections disappear and none is created. Taking the split normal model with Ra−1×Rb−1 and a compact normal cutoff gives the local picture used in the general Whitney-move theorem. The example verifies the move in the lowest dimension and exhibits the role of the two opposite signs.

Facts & Assumptions

[F1]

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

[F2]

The explicit compactly supported vector field moves the first model sheet and compares it with the unchanged second sheet. The local Whitney move

[F3]

Under Countable Choice every compactly supported smooth vector field is complete. Compactly supported smooth vector fields are complete

[F4]

The Whitney move removes a cancelling pair of intersection points. The Whitney move removes a cancelling pair of intersection points

Verification

Given: Countable Choice and the two axis/graph arcs with exactly two simple zeros and the fixed second arc.

1.1givenconstructalgebraF1

Use an increasing coordinate change to put the zeros at u=−1,1, and reflect v if necessary so f is negative between them and positive outside. The ratio λ(u)=(u2−1)/f(u) extends smoothly and positively over the two zeros by their nonzero first derivatives. The map (u,v)↦(u,λ(u)v) is a plane diffeomorphism fixing the axis and taking the other arc to v=u2−1. At its corners the determinant of the ordered tangent directions (1,0),(1,2u) is 2u, giving one negative and one positive intersection.

2.1step 1.1constructalgebraF2F3

Apply the explicit local flow of the model definition: g(u)=b(u)(u2−1−ε), with b=1 on [−1,1], and use a compact vertical cutoff equal to one on the swept segments. The axis is taken to v=g(u) at time one. For ∣u∣≤1, g=u2−1−ε<u2−1. For ∣u∣>1, u2−1>0 and g=b(u)(u2−1)−b(u)ε<u2−1, also where b=0. Thus the moved axis and the unchanged graph are disjoint. The vector field has compact support, so its auxiliary time maps are diffeomorphisms; the first arc is embedded throughout. Pull back by the plane normalization to obtain the asserted isotopy of the original first arc, with the second held fixed.

3.1step 2.1constructF4∎

In complementary dimensions the sheet factors are E=Ra−1 and H=Rb−1, with sheets {v=0,h=0} and {v=u2−1,e=0}. Use the compact normal cutoff from the theorem; a possible intersection still forces e=h=0, where the preceding calculation applies. The normal factors are split sheet directions, not a simultaneous product action on both images. This verifies the exact local picture and the cancellation of the opposite-sign pair.

Depends on

Used by

Nothing in the library uses this result yet.

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