Soft Computing

, Volume 21, Issue 10, pp 2503–2505

An application of subgroup lattices


DOI: 10.1007/s00500-017-2571-1

Cite this article as:
Chen, Y. & Yang, Y. Soft Comput (2017) 21: 2503. doi:10.1007/s00500-017-2571-1


We give a lattice theoretic proof of the well-known result that a finite group G is cyclic iff G has at most one subgroup of each order dividing |G|. Consequently, we show that a division ring D is a field iff D has at most one maximal subfield.


Subgroup lattice Distributive lattice Cyclic group Division ring Wedderburn’s “little” Theorem 

Copyright information

© Springer-Verlag Berlin Heidelberg 2017

Authors and Affiliations

  1. 1.Department of FoundationFujian Commercial CollegeFuzhouChina
  2. 2.Department of MathematicsBeihang UniversityBeijingChina

Personalised recommendations