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 with the same endpoint set at heights and determines a two-point configuration at every intermediate height by horizontal slicing.
Facts & Assumptions
Given: In the geometric-braid convention, take , so , , , and the base tuple is .
For the published geometric base points are and , both in the interior unit disk (Geometric braids in the disc with setwise endpoints).
Each element of is an unordered configuration of exactly two distinct points (Unordered configuration spaces ).
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).
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
Construct the folded arc and vertical strand. Let . In , define Let be the polygonal path , and let . The endpoint sets of at heights and are both . The height of has a local maximum at and a local minimum at , so is not height-monotone.
Verify that these are disjoint embedded arcs in the cylinder. The segment has spatial coordinate , while has except at and has except at . The only possible intersection of and at would be , whose height is while has height at most , so those segments are disjoint. Along the spatial coordinates satisfy ; along they satisfy . A common point must therefore have , which occurs on both segments only at . Thus the three segments form an embedded arc. Its spatial points lie in the convex ball of radius about , since that ball contains all four vertices. As , the arc misses . Also , so lies in ; lies there because .
Compute the slice at height . The height coordinate is strictly monotone on each segment of , so each segment meets that plane once. Linear interpolation gives the three spatial points The first has and the other two have different positive coordinates; their coordinates are also different, so these three points are distinct. The strand contributes the fourth point , which is not on by step 2.1. The slice therefore contains four distinct points.
By [L2], a value of must have exactly two points, whereas the horizontal slice at has four. Hence this embedded picture does not define a path by slicing, despite having the same endpoint set at heights and . 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
- Juan Gonzalez-Meneses, Basic results on braid groups, §§1.2–1.3, printed pp. 4–5 (standard reference, not scraped)