Jump to content

Stanisław Świerczkowski

From Wikipedia, the free encyclopedia

Stanisław Świerczkowski
Born(1932-07-16)16 July 1932
Toruń, Poland
Died30 September 2015(2015-09-30) (aged 83)
NationalityPolish
Alma materUniversity of Wroclaw,
Known forThree-gap theorem, Non-Tetratorus theorem
Children2
AwardsFoundation of Alfred Jurzykowski (1996)[1]
Scientific career
FieldsMathematics
InstitutionsGlasgow University, University of Sussex, University of Washington, Australian National University, Sultan Qaboos University, Queen's University, University of Colorado at Boulder
Doctoral advisorHugo Steinhaus

Stanisław (Stash) Świerczkowski (16 July 1932 – 30 September 2015) was a Polish mathematician famous for his solutions to two iconic problems posed by Hugo Steinhaus: the three-gap theorem and the Non-Tetratorus Theorem.

Early life and education

Stanisław (Stash) Świerczkowski was born in Toruń, Poland. His parents were divorced during his infancy. When war broke out his father was captured in Soviet-controlled Poland and murdered in the 1940 Katyń Massacre. He belonged to the Polish nobility; Świerczkowski's mother belonged to the upper middle class and would have probably suffered deportation and murder by the Nazis. However she had German connections and was able to gain relatively privileged class 2 Volksliste citizenship. At the end of the war Świerczkowski's mother was forced into hiding near Toruń until she was confident that she could win exoneration from the Soviet-controlled government for her Volksliste status and be rehabilitated as a Polish citizen. Meanwhile, Świerczkowski lived in a rented room in Toruń and attended school there.

Świerczkowski won a university place to study astronomy at the University of Wrocław but switched to mathematics to avoid the drudgery of astronomical calculations. He discovered a natural ability through his friendship with Jan Mycielski and was able to remain at Wrocław to complete his masters under Jan Mikusiński. He graduated with a PhD in 1960, his dissertation including the now-famous Three-Distance Theorem, which he proved in 1956 in answer to a question of Hugo Steinhaus.

Noted mathematical results

The three-gap theorem[2] says: take arbitrarily many integer multiples of an irrational number between zero and one and plot them as points around a circle of unit circumference; then at most three different distances will occur between consecutive points. This answered a question of Hugo Steinhaus. The theorem belongs to the field of Diophantine approximation since the smallest of the three distances observed may be used to give a rational approximation to the chosen irrational number. It has been extended and generalised in many ways.[3]

The Non-Tetratorus Theorem, published by Świerczkowski in 1958,[4] states that it is impossible to construct a closed chain (torus) of regular tetrahedra, placed face to face. Again this answered a question of Hugo Steinhaus. The result is attractive and counter-intuitive, since the tetrahedron is unique among the Platonic solids in having this property. Recent work [5] by Michael Elgersma and Stan Wagon has sparked new interest in this result by showing that one can create chains of tetrahedra that are arbitrarily close to being closed.

In 1964, in a joint work with Jan Mycielski, he established one of the early results on the axiom of determinacy (AD), namely that AD implies that all sets of real numbers are Lebesgue measurable.[6]

Świerczkowski's last mathematical work[7] was on proving Gödel's incompleteness theorems using hereditarily finite sets instead of encoding of finite sequences of natural numbers. It is these proofs that were the basis for the production, in 2015, of mechanised proofs of Gödel's two famous theorems.[8]

Career

Świerczkowski had a very migratory career. He was allowed abroad from Poland to study at Dundee University where his work with Alexander Murray MacBeath would later attract the attention of André Weil. He then took up a research fellowship at Glasgow University before being obliged to return to Poland. When the Polish Academy of Sciences granted him a passport to attend a conference in Stuttgart he used this as an opportunity to leave Poland for good in 1961, first resuming his fellowship in Glasgow before taking a job in the recently created University of Sussex. In 1963 he visited André Weil at the Institute for Advanced Studies and thereafter, between 1964 and 1973, held posts at the University of Washington, the Australian National University and Queen's University in Canada. In 1973 he left mathematics, moved to the Netherlands and built a yacht in which he sailed around the world for ten years. The period 1986 to 1997 was again spent teaching mathematics, at Sultan Qaboos University. His last post was at the University of Colorado at Boulder (1998–2001). Thereafter he retired to Tasmania.

References

  1. ^ Jerzy Krzywicki (2000). "Nagrody Fundacji Jurzykowskiego w matematyce" (PDF). Roczniki Polskiego Towarzystwa Matematycznego Seria II: Wiadomo Sci Matematyczne XXXVI. 73: 115–138.
  2. ^ Three-Distance Theorem at Theorem of the Day
  3. ^ Alessandri, P., and Berthé, V. (1998). "Three distance theorems and combinatorics on words". L'Enseignement Mathématique. 44: 103–132.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  4. ^ Świerczkowski, S. (1958). "On a free group of rotations of the Euclidean space". Indagationes Mathematicae. 61: 376–378. doi:10.1016/s1385-7258(58)50051-1.
  5. ^ Elgersma, M.; Wagon, S. (2017). "An asymptotically closed loop of tetrahedra". The Mathematical Intelligencer. 39 (3): 40–45. doi:10.1007/s00283-016-9696-4. {{cite journal}}: Unknown parameter |lastauthoramp= ignored (|name-list-style= suggested) (help)
  6. ^ Mycielski J. and Świerczkowski, S. (1964). "On the Lebesgue measurability and the axiom of determinateness". Fund. Math. 54: 67–71.
  7. ^ Świerczkowski, S. (2003). "Finite sets and Gödel's incompleteness theorems". Dissertationes Mathematicae. 422: 1–58. doi:10.4064/dm422-0-1.
  8. ^ Lawrence C. Paulson (2015). "A Mechanised Proof of Gödel's Incompleteness Theorems Using Nominal Isabelle". Journal of Automated Reasoning. 55 (1): 1–37. CiteSeerX 10.1.1.697.5227. doi:10.1007/s10817-015-9322-8.