Arne Beurling

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Arne Beurling
Arne Beurling, foto TT 1940-tal.jpg
Arne Beurling in 1940s
Born(1905-02-03)3 February 1905
Died20 November 1986(1986-11-20) (aged 81)
NationalitySwedish
Alma materUppsala University
Known forBeurling algebra
Beurling factorization
Beurling–Lax theorem
Beurling–Nyman criterion
Scientific career
FieldsMathematics
InstitutionsUppsala University
Institute for Advanced Study
Doctoral advisorAnders Wiman
Doctoral studentsLennart Carleson
Carl-Gustav Esseen
Statue of Arne Beurling in Uppsala.

Arne Carl-August Beurling (3 February 1905 – 20 November 1986) was a Swedish mathematician and professor of mathematics at Uppsala University (1937–1954) and later at the Institute for Advanced Study in Princeton, New Jersey. Beurling worked extensively in harmonic analysis, complex analysis and potential theory. The "Beurling factorization" helped mathematical scientists to understand the Wold decomposition, and inspired further work on the invariant subspaces of linear operators and operator algebras, e.g. Håkan Hedenmalm's factorization theorem for Bergman spaces.

He is perhaps most famous for single-handedly decrypting an early version of the German cipher machine Siemens and Halske T52 in a matter of two weeks during 1940, using only pen and paper. This machine's cipher is generally considered to be more complicated than that of the more famous Enigma machine.

Early life[edit]

Beurling was born on 3 February 1905 in Gothenburg, Sweden and was the son of the landowner Konrad Beurling and baroness Elsa Raab.[1] After graduating in 1924, he was enrolled at the Uppsala University where he received a Bachelor of Arts degree in 1926 and two years later a Licentiate of Philosophy degree.[1]

Career[edit]

Early career[edit]

Beurling was assistant teacher at Uppsala University from 1931 to 1933.[1] He received his doctorate in mathematics in 1933 for his dissertation Études sur un problème de majoration.[2] Beurling was a docent of mathematics at Uppsala University from 1933 and then professor of mathematics from 1937 to 1954.[1]

World War II[edit]

In the summer of 1940 he single-handedly deciphered and reverse-engineered an early version of the Siemens and Halske T52 also known as the Geheimfernschreiber ("secret teletypewriter") used by Nazi Germany in World War II for sending ciphered messages.[3] The T52 was one of the so-called "Fish cyphers", that, using transposition, created nearly one quintillion (893,622,318,929,520,960) different variations. It took Beurling two weeks to solve the problem using pen and paper. Using Beurling's work, a device was created that enabled Sweden to decipher German teleprinter traffic passing through Sweden from Norway on a cable. In this way, Swedish authorities knew about Operation Barbarossa before it occurred.[4] Since the Swedes would not reveal how this knowledge was attained, the Swedish warning was not treated as credible by Soviets[citation needed].

This became the foundation for the Swedish National Defence Radio Establishment (FRA). The cypher in the Geheimfernschreiber is generally considered to be more complex than the cypher used in the Enigma machines.[5]

Later life[edit]

He was visiting professor at Harvard University from 1948 to 1949.[6] From 1954 he was professor at the Institute for Advanced Study in Princeton, New Jersey, United States, where he took over Albert Einstein's office.[7]

He was the doctoral advisor of Lennart Carleson and Carl-Gustav Esseen.

Personal life[edit]

Arne Beurling´s family grave at Norra begravningsplatsen in Solna.

Arne Beurling was first married (1936–40) to Britta Östberg (born 1907), daughter of Henrik Östberg and Gerda Nilsson. In 1950 he married Karin Lindblad (1920–2006), daughter of ironmonger Henric Lindblad and Wanja Bengtsson.[1] Karin was a distinguished Ph.D student from Uppsala University. When they lived in Princeton, she worked in a biochemistry lab at Princeton University.[8] He had two children from his first marriage — Pehr-Henrik (1936-62) and Jane (1938-92).[1]

Beurling's great-grandfather was Pehr Henrik Beurling (1758 or 1763–1806), who founded a high quality clock factory in Stockholm in 1783.

Death[edit]

Arne Beurling died in 1986 and was buried at Norra begravningsplatsen in Solna.[9]

In popular culture[edit]

Beurling's prowess as a cryptanalysist is the subject of the 2005 short opera Krypto CEG by Jonas Sjöstrand and Kimmo Eriksson.

Awards and decorations[edit]

Honours[edit]

See also[edit]

References[edit]

  1. ^ a b c d e f g h i j k l m n Harnesk, Paul, ed. (1964). Vem är vem?. 2, Svealand utom Stor-Stockholm [Who is Who?. 2, Svealand excluding Greater Stockholm] (in Swedish) (2nd ed.). Stockholm: Bokförlaget Vem är vem. p. 82.
  2. ^ Beurling, Arne (1933). Études sur un problème de majoration (in French). Uppsala: [s.n.]
  3. ^ Beckman, B. (2002). Codebreakers: Arne Beurling and the Swedish crypto program during World War II. Providence, RI: American Mathematical Society.
  4. ^ Beckman, Bengt (2002). Codebreakers: Arne Beurling and the Swedish Crypto Program During World War II. American Mathematical Society. p. 11. ISBN 9780821828892. Retrieved 25 March 2022.
  5. ^ Rijmenants, Dirk (2008), Focus: Siemens & Halske T-52
  6. ^ O'Connor, J J; Robertson, E F (2008). "Arne Carl-August Beurling". School of Mathematics and Statistics, University of St Andrews, Scotland. Retrieved 27 March 2015.
  7. ^ Bergström, Christer (25 October 2010). "Svensk knäckte nazisternas hemliga koder" [A Swede cracked the Nazis' secret codes]. Svenska Dagbladet (in Swedish). Retrieved 27 March 2015.
  8. ^ "Search Results for Arne Beurling". School of Mathematics and Statistics, University of St Andrews, Scotland. August 2001. Retrieved 1 September 2015.
  9. ^ "Norra begravningsplatsen, kvarter 10A, gravnummer 413" (in Swedish). Hittagraven.se. Retrieved 27 March 2015.
  10. ^ "Book of Members, 1780–2010: Chapter B" (PDF). American Academy of Arts and Sciences. Archived (PDF) from the original on 25 July 2011. Retrieved 25 June 2011.

External links[edit]