Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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.

An embedded height-folded arc has no configuration-loop slices

Statement refuted

Every embedded two-strand arc picture in D∘×I with the same endpoint set {q1,q2} at heights 0 and 1 determines a two-point configuration at every intermediate height by horizontal slicing.

Facts & Assumptions

Given: In the geometric-braid convention, take n=2, so h=1/12, q1=(−h,0), q2=(h,0), and the base tuple is Q=(q1,q2).

[L1]

For n=2 the published geometric base points are q1=(−h,0) and q2=(h,0), both in the interior unit disk (Geometric braids in the disc with setwise endpoints).

[L2]

Each element of C2(D∘) is an unordered configuration of exactly two distinct points (Unordered configuration spaces Cn(X)).

[L3]

A geometric braid strand is a graph over the height parameter and meets each height plane exactly once (Geometric braids in the disc with setwise endpoints).

[L4]

The slicing lemma applies to level-preserving geometric braids and gives a configuration-loop slice from their coordinate motions (A geometric braid slices to an interior configuration loop).

No choice principle is assumed or used; the witness consists of explicit points and line segments.

Counterexample

technique · direct
1.1L1given

Construct the folded arc and vertical strand. Let a=h/4. In R2×I, define P0=(−h,0,0),P1=(−h+a,0,3/4),P2=(−h+2a,a,1/4),P3=(−h,0,1). Let A be the polygonal path P0P1∪P1P2∪P2P3, and let B={(h,0,t):t∈I}. The endpoint sets of A∪B at heights 0 and 1 are both {q1,q2}. The height of A has a local maximum 3/4 at P1 and a local minimum 1/4 at P2, so A is not height-monotone.

2.1step 1.1L1L3algebra

Verify that these are disjoint embedded arcs in the cylinder. The segment P0P1 has spatial coordinate y=0, while P1P2 has y>0 except at P1 and P2P3 has y>0 except at P3. The only possible intersection of P0P1 and P2P3 at y=0 would be P3, whose height is 1 while P0P1 has height at most 3/4, so those segments are disjoint. Along P1P2 the spatial coordinates satisfy x+h−y=a; along P2P3 they satisfy x+h=2y. A common point must therefore have y=a, which occurs on both segments only at P2. Thus the three segments form an embedded arc. Its spatial points lie in the convex ball of radius 5a about q1, since that ball contains all four vertices. As 5a<3a=3h/4<2h=∣q2−q1∣, the arc misses B. Also ∣q1∣+5a<h+3a=7h/4=7/48<1, so A lies in D∘×I; B lies there because ∣q2∣=h<1.

3.1step 1.1step 2.1L2algebra

Compute the slice at height 1/2. The height coordinate is strictly monotone on each segment of A, so each segment meets that plane once. Linear interpolation gives the three spatial points (−h+2a/3,0),(−h+3a/2,a/2),(−h+4a/3,2a/3). The first has y=0 and the other two have different positive y coordinates; their x coordinates are also different, so these three points are distinct. The strand B contributes the fourth point (h,0)=q2, which is not on A by step 2.1. The slice therefore contains four distinct points.

4.1step 3.1L2L3L4∎

By [L2], a value of C2(D∘) must have exactly two points, whereas the horizontal slice at 1/2 has four. Hence this embedded picture does not define a path I→C2(D∘) by slicing, despite having the same endpoint set {q1,q2} at heights 0 and 1. Its folded arc also fails the one-point-per-height condition in [L3], so the level-preserving braid slicing lemma [L4] does not apply.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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