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

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

Les sous-groupes fermés de rang maximum des groupes de Lie clos

Open access
Borel, A., Siebenthal, J. · 1949 · Commentarii Mathematici Helvetici

Overview

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1007/bf02565599

Cites

5 of 5 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Cites

Show all 5 references

Research works printed but not linked: 8

  1. VoirB. L. van der Waerden, Die Klassifikation der einfachen Lieschen Gruppen, Math. Zeitschr.37, 1933, pp. 448; aussiE. Stiefel, l. c. note 3, p. 378; les vecteurs définis par M. Stiefel ne sont pas exactement les vecteurs racines, mais ont les longueurs inversément proportionnelles.
  2. Voir par exempleE. Cartan,, l. c. note 2, No 52.
  3. cf.E. Cartan,, l. c. 2), nos 17, 18, 28, 29.
  4. Ils se trouvent par exemple dans:E. Stiefel,, l. c. note 3. · DOI · Paper page
  5. Nous désignons ainsi l’ensemble des éléments deG échangeables avec tous les éléments deT l représentés par des points deR l−2 .R l−2 recouvre un sous-groupefermé àl—2 paramètres deT l , carR l−2 a en commun avec le réseau unité un réseau àl—2 dimensions (cf.E. Stiefel,, l. c., p. 361). · DOI · Paper page
  6. VoirE. Cartan,, l. c., note 6; aussi l. c., note 2, No 48.
  7. Cela veut dire que les éléments deK sont dans un entourageU de l’unitée deG, comprennente et dépendent de façon continue den′ paramètres; de plus le produit de deux éléments deK appartient àK s’il est contenu dansU; d’après un théorème deE. Cartan, l. c., note 2, No. 26,K est un groupe de Lie et ses points forment une variété analytique dans un système de coordonnées analytiques deG. C’est en particulier une portion de plan àn′ dimensions dans un système de coordonnées canoniques; enfin, en restreignant éventuellement la variété deK, on peut supposer queK possède l’inverse de chacun de ses éléments.
  8. E. Cartan, l. c.,, note 2, No 41.

Cited by

Metadata

Authors
Borel, A., & Siebenthal, J.
Venue
Commentarii Mathematici Helvetici
Published
1949-12
Volume
23
Issue
1
Pages
200-221
ISSN
  • 0010-2571 (ISSN-L)
  • 1420-8946
OpenAlex
W1968275987
Cited by
355
References
5
FWCI
2.70
Type
journal article
Language
fr
Open access
green

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

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.