Concept

Finitely generated abelian group

In abstract algebra, an abelian group is called finitely generated if there exist finitely many elements in such that every in can be written in the form for some integers . In this case, we say that the set is a generating set of or that generate . Every finite abelian group is finitely generated. The finitely generated abelian groups can be completely classified. The integers, , are a finitely generated abelian group. The integers modulo , , are a finite (hence finitely generated) abelian group. Any direct sum of finitely many finitely generated abelian groups is again a finitely generated abelian group. Every lattice forms a finitely generated free abelian group. There are no other examples (up to isomorphism). In particular, the group of rational numbers is not finitely generated: if are rational numbers, pick a natural number coprime to all the denominators; then cannot be generated by . The group of non-zero rational numbers is also not finitely generated. The groups of real numbers under addition and non-zero real numbers under multiplication are also not finitely generated. The fundamental theorem of finitely generated abelian groups can be stated two ways, generalizing the two forms of the fundamental theorem of finite abelian groups. The theorem, in both forms, in turn generalizes to the structure theorem for finitely generated modules over a principal ideal domain, which in turn admits further generalizations. The primary decomposition formulation states that every finitely generated abelian group G is isomorphic to a direct sum of primary cyclic groups and infinite cyclic groups. A primary cyclic group is one whose order is a power of a prime. That is, every finitely generated abelian group is isomorphic to a group of the form where n ≥ 0 is the rank, and the numbers q1, ..., qt are powers of (not necessarily distinct) prime numbers. In particular, G is finite if and only if n = 0. The values of n, q1, ..., qt are (up to rearranging the indices) uniquely determined by G, that is, there is one and only one way to represent G as such a decomposition.

Official source

https://en.wikipedia.org/wiki/Finitely_generated_abelian_group

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related courses (32)

MATH-410: Riemann surfaces

This course is an introduction to the theory of Riemann surfaces. Riemann surfaces naturally appear is mathematics in many different ways: as a result of analytic continuation, as quotients of complex domains under discontinuous group actions, as algebraic ...

MATH-311: Algebra IV - rings and modules

Ring and module theory with a major emphasis on commutative algebra and a minor emphasis on homological algebra. ...

COM-401: Cryptography and security

This course introduces the basics of cryptography. We review several types of cryptographic primitives, when it is safe to use them and how to select the appropriate security parameters. We detail how they work and sketch how they can be implemented. ...

Related lectures (32)

Uniqueness in Abelian Groups

Explores the uniqueness in abelian groups, emphasizing the structure and choices within the groups.

Useful Lemmas for p-Groups

Covers useful lemmas for p-groups, including divisibility properties and the existence of specific elements in finite abelian groups.

Finite Abelian Groups & Rings

Explores the classification of finite abelian groups and rings, emphasizing elementary divisors and properties of rings.

Related publications (18)

Representational similarity modulates neural and behavioral signatures of novelty: Model simulations

Wulfram Gerstner

Here, we provide model simulation data accompanying the analysis of neural and behavioral data in our article 'Representational similarity modulates neural and behavioral signatures of novelty'. This data set contains (i) simulations of similarity-based novelty models for fitting of V1 novelty responses: grid_search_results.zip (ii) simulations for parameter robustness analysis of similarity-based novelty, fit to V1 novelty responses: gridsearch_robustness_width.zip (iii) simulations of novelty-RL agents

Zenodo2026

Using Language Models for Handling Structured Data at Scale

In its most general form, structured data represents information arranged according to predefined schemas that make it machine-readable and systematically interpretable. It can support reasoning, grounding, and it can be easily automatically processed. With the rise of large language models, these properties are becoming increasingly valuable. Structured data offers a way to make model behavior more reliable, interpretable, and efficient. As a result, the ability to work effectively with structured data, bo

EPFL2026

Effect of ambient turbulent intensity on the wake of a floating wind turbine under surge motion

Xiao-Yu Hu

The interaction between platform motion and atmospheric turbulence plays a critical role in shaping the wake development of floating offshore wind turbines. Large-eddy simulations are performed to investigate the influence of incoming atmospheric boundary layer turbulence intensity on the wake of a floating offshore wind turbine undergoing surge motion. Three inflow turbulence levels and four surge motion frequencies are considered. Increasing inflow turbulence accelerates wake recovery for the fixed turbin

IOP Publishing2026

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Official source

https://en.wikipedia.org/wiki/Finitely_generated_abelian_group

About this result

Related courses (32)

MATH-410: Riemann surfaces

MATH-311: Algebra IV - rings and modules

Ring and module theory with a major emphasis on commutative algebra and a minor emphasis on homological algebra. ...

COM-401: Cryptography and security

Related lectures (32)

Uniqueness in Abelian Groups

Explores the uniqueness in abelian groups, emphasizing the structure and choices within the groups.

Useful Lemmas for p-Groups

Covers useful lemmas for p-groups, including divisibility properties and the existence of specific elements in finite abelian groups.

Finite Abelian Groups & Rings

Explores the classification of finite abelian groups and rings, emphasizing elementary divisors and properties of rings.

Related publications (18)

Representational similarity modulates neural and behavioral signatures of novelty: Model simulations

Wulfram Gerstner

Zenodo2026

Using Language Models for Handling Structured Data at Scale

EPFL2026

Effect of ambient turbulent intensity on the wake of a floating wind turbine under surge motion

Xiao-Yu Hu

IOP Publishing2026

Related people (15)

Tim Ruben Davidson

Expertise deep generative models; agentic systems; synthetic data; representation learning Mission I study how deep generative models can be used to power agentic systems and generate useful synthetic data

Anna Lachowska

Teaching & PhD Courses Algebra MATH-310 This is an introduction to modern algebra: groups, rings and fields. Analysis I MATH-101(e) We study the fundamental concepts of analysis, calculus and the integral of real-valued functions of a real variable. Analysis II MATH-106(e) The course studies fundamental concepts of analysis and the calculus of functions of several variables. Representation theory I - finite groups MATH-314 This is a standard c

Mohammad Amin Shokrollahi

Amin Shokrollahi has worked on a variety of topics, including coding theory, computational number theory and algebra, and computational/algebraic complexity theory. He is best known for his work on iterative decoding algorithms of graph based codes, an area in which he holds a number of granted and pending patents. He is the co-inventor of Tornado codes, and the inventor of Raptor codes. His codes have been standardized and successfully deployed in practical areas dealing with data transmission over lossy networks. Prior to joining EPFL, Amin Shokrollahi has held positions as the chief scientist of Digital Fountain, member of the technical staff at Bell Laboratories, senior researcher at the International Computer Science Insitute in Berkeley, and assistant professor at the department of computer science of the university of Bonn. He is a Fellow of the IEEE, and he was awarded the Best Paper Award of the IEEE IT Society in 2002 for his work on iterative decoding of LDPC code, the IEEE Eric Sumner Award in 2007 for the development of Fountain Codes, and the joint Communication Society/Information Theory Society best paper award of 2007 for his paper on Raptor Codes.

Bruno Emanuel Ferreira De Sousa Correia

Throughout my PhD and postdoctoral studies I was trained in world-renowned laboratories and institutions in the United States of America (University of Washington and The Scripps Research Institute). Very early in my scientific career I found out my fascination about protein structure and function. My PhD studies evolved in the direction of immunogen design and vaccine engineering which sparked my interest in the many needs and opportunities in vaccinology and translational research. My efforts resulted in an enlightening piece of work where for the first time, computationally designed immunogens elicited potent neutralizing antibodies. During my postdoctoral studies I joined a chemical biology laboratory at the Scripps Research Institute. In this stage I developed novel chemoproteomics methods for the identification of protein-small molecule interaction sites in complex proteomes. In March 2015, I joined the École Polytechnique Fédérale de Lausanne (EPFL) – Switzerland as a tenure track assistant professor. The focus of my research group is to develop computational tools for protein design with particular emphasis in applying these strategies to immunoengineering (e.g. vaccine and cancer immunotherapy). The activities in my laboratory focus on computational design methods development and experimental characterization of the designed proteins. Our laboratory has been awarded with 2 prestigious research grants from the European Research Council. Lastly, I have been awarded the prize for best teacher of Life sciences in 2019.

Emre Telatar

I. Emre Telatar received the B.Sc. degree in electrical engineering from the Middle East Technical University, Ankara, Turkey, in 1986. He received the S.M. and Ph.D. degrees in electrical engineering and computer science from the Massachusetts Institute of Technology, Cambridge, in 1988 and 1992 respectively. In 1992, he joined the Communications Analysis Research Department at AT&T Bell Laboratories (later Lucent Technologies), Murray Hill, NJ. He has been at the EPFL since 2000. Emre Telatar was the recipient of the IEEE Information Theory Society Paper Award in 2001. He was a program co-chair for the IEEE International Symposium on Information Theory in 2002, and associate editor for Shannon Theory for the IEEE Information Theory Transactions from 2001 to 2004. He was awarded the EPFL Agepoly teaching prize in 2005. Emre Telatar's research interests are in communication and information theories.

Roger Hersch

Roger D. Hersch is professor of Computer Science and head of the Peripheral Systems Laboratory at EPFL. He received his engineering degree from ETHZ in 1975, worked in industry from 1975 to 1980, and obtained his PhD degree from EPFL in 1985. He directed the widely known Visible Human Web Server project , which offers a number of services for the visualization of human anatomy. His current research focuses on color reproduction, spectral color prediction models, moiré imaging, and visual document security. Recent achievements include the PhotoProtect technology, which incorporates text as chromatic differences in order to protect identity photographs (Swiss driving license), microstructure imaging, which is used by railways companies (SNCF, RENFE) and festival organizers (Paleo) to print tickets at home and the band moire imaging technology for the protection of security documents.

Martin Vetterli

Martin Vetterli was appointed president of EPFL by the Federal Council following a selection process conducted by the ETH Board, which unanimously nominated him. Professor Vetterli was born on 4 October 1957 in Solothurn and received his elementary and secondary education in Neuchâtel Canton. He earned a Bachelor’s degree in electrical engineering from ETH Zurich (ETHZ) in 1981, a Master’s of Science degree from Stanford University in 1982, and a PhD from EPFL in 1986. Professor Vetterli taught at Columbia University as an assistant and then associate professor. He was subsequently named full professor in the Department of Electrical Engineering and Computer Sciences at the University of California at Berkeley before returning to EPFL as a full professor at the age of 38. He has also taught at ETHZ and Stanford University. Professor Vetterli has earned numerous national and international awards for his research in electrical engineering, computer science and applied mathematics, including the National Latsis Prize in 1996. He is a fellow of both the Association for Computing Machinery and the Institute of Electrical and Electronics Engineers and a member the US National Academy of Engineering. He has published over 170 articles and three reference works. Professor Vetterli’s work on the theory of wavelets, which are used in signal processing, is considered to be of major importance by his peers, and his areas of expertise, including image and video compression and self-organized communication systems, are central to the development of new information technologies. As the founding director of the National Centre of Competence in Research on Mobile Information and Communication Systems, Professor Vetterli is a staunch advocate of transdisciplinary research. Professor Vetterli knows EPFL inside and out. An EPFL graduate himself, he began been teaching at the school in 1995, was vice president for International Affairs and then Institutional Affairs from 2004 to 2011, and served as dean of the School of Computer and Communication Sciences in 2011 and 2012. In addition to his role as president of the National Research Council of the Swiss National Science Foundation, a position he held from 2013 to 2016, he heads the EPFL’s Audiovisual Communications Laboratory (LCAV) since 1995. Professor Vetterli has supported more than 60 students in Switzerland and the United States in their doctoral work and makes a point of following their highly successful careers, whether it is in the academic or business world. He is the author of some 50 patents, some of which were the basis for start-ups coming out of his lab, such as Dartfish and Illusonic, while others were sold (e.g. Qualcomm) as successful examples of technology transfer. He actively encourages young researchers to market the results of their work.

Leonid Monin

Teaching & PhD Courses Algebra III - rings and fields MATH-215 This is an introductory course in ring and field theory. Analysis I (English) MATH-101(en) We study the fundamental concepts of analysis, calculus and the integral of real-valued functions of a real variable. Topology III - Homology MATH-323 Homology is one of the most important tools to study topological spaces and it plays an important role in many fields of mathematics. The aim of this course is

Patrick Thiran

Patrick Thiran is a full professor in network and systems theory at the School of Computer and Communication Sciences at EPFL. He holds an electrical engineering degree from the Université Catholique de Louvain, Louvain-la-Neuve, Belgium, an M.Sc. degree in electrical engineering from the University of California at Berkeley, USA, and he received the PhD degree from EPFL, in 1996. He became an adjunct professor in 1998, an assistant professor in 2002, an associate professor in 2006 and a full professor in 2011. He was with Sprint Advanced Technology Labs in Burlingame, California, in 2000-01. His research interests are in communication and social networks, performance analysis and stochastic models. He is currently active in the analysis and design of wireless and PLC networks (scaling laws, medium access control), in network monitoring (network tomography, multi-layer networks), and data-driven network science. He also contributed to network calculus and to the theory of locally coupled neural networks and self-organizing maps. He served as an associate editor for the IEEE Transactions on Circuits and Systems in 1997-99 and for the IEEE/ACM Transactions on Networking in 2006-10. He is currently on the editorial board of the IEEE Journal on Selected Areas in Communication. He is/was on the program committee of different conferences in networking, including ACM Sigcomm, Sigmetrics, IMC, CoNext and IEEE Infocom. He was TPC chair of AMC IMC 2011 and CoNext 2012. He is a Fellow of the Belgian American Educational Foundation and of the IEEE. He received the 1996 EPFL Doctoral Prize and the 2008 Crédit Suisse Teaching Award.

Nicolas Monod

Related units (3)

CIB - Administration

Biorobotics Laboratory

Chair of Ergodic and Geometric Group Theory

Related concepts (15)

Abstract algebra

In mathematics, more specifically algebra, abstract algebra or modern algebra is the study of algebraic structures. Algebraic structures include groups, rings, fields, modules, vector spaces, lattices, and algebras over a field. The term abstract algebra was coined in the early 20th century to distinguish it from older parts of algebra, and more specifically from elementary algebra, the use of variables to represent numbers in computation and reasoning.

Free abelian group

In mathematics, a free abelian group is an abelian group with a basis. Being an abelian group means that it is a set with an addition operation that is associative, commutative, and invertible. A basis, also called an integral basis, is a subset such that every element of the group can be uniquely expressed as an integer combination of finitely many basis elements. For instance the two-dimensional integer lattice forms a free abelian group, with coordinatewise addition as its operation, and with the two points (1,0) and (0,1) as its basis.

Rank of an abelian group

In mathematics, the rank, Prüfer rank, or torsion-free rank of an abelian group A is the cardinality of a maximal linearly independent subset. The rank of A determines the size of the largest free abelian group contained in A. If A is torsion-free then it embeds into a vector space over the rational numbers of dimension rank A. For finitely generated abelian groups, rank is a strong invariant and every such group is determined up to isomorphism by its rank and torsion subgroup.

Related exercises (2)

Study of density function

Consider the volume density of charge ρ(x,y,z)u2004=u2004ρ(x) of the figure on the left, infinite in the directions y and z, where: aρ₀₊u2004=u2004Au2006[Cu2006m⁻²]. a) Determine and graphically represent the electric field associated for all of the values of x. Determine and graphically represent the potential V(x), with the condition V(−a/2)u2004=u20040. b) Now consider the charge density ρ(x,y,z)u2004=u2004ρ(x) of the figure on the right side, where bρ⁰⁻u2004=u2004aρ₀₊u2004=u2004A. Determine and graphi

Gravitational field inside the Earth

We consider the earth as a compact set of concentric spheres.

Use a geometric argument to show that the field vanishes inside a spherical shell. Thus, for a given point, only the spherical shell for which the point is in the exterior contributes to the field at that point.
Compute the gravitational field inside the earth and outside as a function of the distance to the centre.
A volume element of a sphere is expressed in spherical coordinates as (c.f. figure): dVu2004=

Related notebooks (10)

Classical Monte Carlo Simulations of the Ising Model on Square Lattice

"## Classical Monte-Carlo simulations of the Ising model on square lattice\n", "\n", "The Ising model considers the following Hamiltonian\n", "\n", "

\\hat{\\mathcal{H}} = -J\\displaystyle\\sum_{}\\sigma_i \\sigma_j

,\n", "\n", "in which spins

\\sigma_i

can take only two discrete values

\\sigma_i \\in \\{-1,+1\\}

. Below, we will consider spins on two-dimensional square lattice taking into account couplings

J

only for the nearest neighbor sites. For

J > 0

the ferromagneti

Tight-Binding Approximation for 2D Lattices: Square, Triangular, Lieb, and Honeycomb

In [1]: import numpy as np import matplotlib.pyplot as plt

from future import print_function

from ipywidgets import interact, interactive, fixed, interact_manual import ipywidgets as widgets %matplotlib inline In [2]: def band(nkl,kpoints,ham): :param k: wave number nk=32 # Define the position of the original lattice #klines=np.zeros((nkl-1,nk)) n=0 d=np.size(ham([0.0,0.0]),1) evk=np.zeros((nknkl-nk-1,d)) lenk=np.zeros((nknkl-nk-1,d)) for i in range(0,nkl-1)

Estimation of Electron Density and Mean Free Time for Transparent Conductors

Chapter 1: Transparent Conductors[1]¶ Instruction: The purpose of this notebook is to try and find values of electron density and mean free time for a material suitable to be used as a transparent conductors. The final estimate should be the order of the two parameters to be used[2]¶ In [1]: import numpy as np from bokeh.io import push_notebook, output_notebook, show from bokeh.layouts import row, column from bokeh.plotting import figure output_notebook() from ipywidgets import interact from collect

Understanding the Haar Basis for Grayscale Image Compression

A Basis for Grayscale Images[1]¶

                                      [2]Paolo Prandoni, [3]LCAV, EPFL

The concept of "basis" for a vector space is one of the most profound and fruitful ideas in linear algebra. Basis vectors are the "building blocks" that all other vectors are built from; by "disassembling" a vector into a linear combination of basis elements we are able to "look inside" the vector and highlight many of its relevant features. A vector space has an infinite number o

Powder X-Ray Diffraction Analysis: Exploring Crystal Structures.

XRay Diffraction[1]¶ The purpose of this notebook is to study the powder XRay diffraction spectra of some systems. When the crystal is hit with an XRay wave, the wave is diffracted only for specific case where the Bragg condition is satisfied for one of the lattice planes in the material. For single crystal diffraction, the condition is satisfied only for specific orientation of the crystal, such that the incident ray has the correct

\theta

value for the plane. In powder XRay data, however, any plane ori