Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 969

The DOI matches its Crossref record.

Theory of Braids

Artin, E.·1947·The Annals of Mathematics

Abstract

A theory of braids leading to a classification was given in my paper Theorie der Zopfe in vol. 4 of the Hamburger Abhandlungen (quoted as Z). Most of the proofs are entirely intuitive. That of the main theorem in ?7 is not even convincing. It is possible to correct the proofs. The difficulties that one encounters if one tries to do so come from the fact that projection of the braid, which is an excellent tool for intuitive investigations, is a very clumsy one for rigorous proofs. This has lead me to abandon projections altogether. We shall use the more powerful tool of braid coordinates and obtain thereby farther reaching results of greater generality. A few words about the initial definitions. The fact that we assume of a braid string that it ends in a straight line is of course unimportant. It could be replaced by limit assumptions or introduction of infinite points. The present definition was selected because it makes some of the discussions easier and may be replaced any time by another one. I also wish to stress the fact that the definition of s-isotopy is of a provisional character only and is replaced later (Definition 3) by a general notion of isotopy. More than half of the paper is of a geometric nature. In this part we develop some results that may escape an intuitive investigation (Theorem 7 to 10). We do not prove (as has been done in Z) that the relations (18) (19) are defining relations for the braid group. We refer the reader to a paper by F. Bohnenblust1 where a proof of this fact and of many of our results is given by purely group theoretical methods. Later the proofs become more algebraic. With the developed tools we are able to give a unique normal form for every braid2 (Theorem 17, fig. 4 and remark following Theorem 18). In Theorem 19 we determine the center of the braid group and finally we give a characterisation of braids of braids. I would like to mention in this introduction a few of the more important of the unsolved problems: 1) Assume that two braids can be deformed into each other by a deformation of the most general nature including self intersection of each string but avoiding intersection of two different strings. Are they isotopic? One would be inclined to doubt it. Theorem 8 solves, however, a special case of this problem. 2) In Definition 3, we introduce a notion of isotopy that is already very general. What conditions must be put on a many to many mapping so that the result of Theorem 9 still holds?

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.2307/1969218

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 969

Metadata

Authors
Artin, E.
Venue
The Annals of Mathematics
Publisher
JSTOR
Published
1947-01
Volume
48
Issue
1
Pages
101
ISSN
0003-486X (ISSN-L)
OpenAlex
W2327745271
Cited by
969
References
0
FWCI
3.28
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Theory of Braids. https://app.cochat.ai/papers/10.2307/1969218
The paper
Artin, E. (1947). Theory of Braids. The Annals of Mathematics. https://doi.org/10.2307/1969218

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.