✦ LIBER ✦

Conjugacy of Borel subgroups: An easy proof

✍ Scribed by Moss Eisenberg Sweedler

Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 682 KB
Volume: 20
Category: Article
ISSN: 0001-8708
DOI: 10.1016/0001-8708(76)90171-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An easy proof of ponizovski's theorem

✍ Matthew Gould 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 78 KB

A geometric proof of the conjugacy of bo

A geometric proof of the conjugacy of borel and Cartan subalgebras of the classical simple Lie algebras

✍ Michael A Gauger 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 255 KB

An easy proof of the Rogers-Ramanujan id

An easy proof of the Rogers-Ramanujan identities

✍ D.M. Bressoud 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 286 KB

An easy priority-free proof of a theorem

An easy priority-free proof of a theorem of Friedberg

✍ Martin Kummer 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 294 KB

An Easy Proof of the Askey–Wilson Integr

An Easy Proof of the Askey–Wilson Integral and Applications of the Method

✍ Douglas Bowman 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 85 KB

The upper bound theorem for polytopes: a

The upper bound theorem for polytopes: an easy proof of its asymptotic version

✍ Raimund Seidel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 128 KB

Since at least half of the d edges incident to a vertex u of a simple d-polytope P either all point "up" or all point "down," v must be the unique "bottom" or "top" vertex of a face of P of dimension at least d/2. Thus the number of P's vertices is at most twice the number of such high-dimensional f