Metric Spaces
Comprehensive module covering 5 sections in Functional Analysis.
REPOSITORY
BMLABS MATHEMATICS REPOSITORY
mathematics.bmlabs.co.in
Author
Dr. Bivash Majumder
Assistant Professor in Mathematics
Prabhat Kumar College, Contai
Abstract Algebra · Introduction to Groups
Learn Additive Groups Number Systems in Introduction to Groups.
Understand the central mathematical ideas of Additive Groups Number Systems.
Use the key definitions and notation accurately.
Interpret the principal results and their mathematical conditions.
Follow and justify the main proof strategy step by step.
Learning studio
1 concepts
4 guided steps
3 worked items
Learning path
Learning command centre
Progress is stored only in this browser. Academic content remains complete and printable.
1
Definitions
2
Theorems
0
Lemmas
0
Corollaries
2
Proofs
2
Examples
1
Exercises
2
Visual tools
Local progress
Lesson profile
definition
Let be a non-empty set with addition . Then is called an if is a group. In additive notation, the identity element is denoted by , and the inverse of is denoted by .
theorem
Let be the set of integers under ordinary addition. Then is a group.
theorem
Let . If , then is a group under ordinary addition.
introductory
Interactive concept atlas
19 concepts · 23 relationships · auto mode
Concept map ready to load
The graph engine loads only when this learning map approaches the viewport.
Additive Groups Number Systems Concept Map. 19 concepts.
1
Definitions
4
Results
3
Applications
2
Practice
2 practice items
After learning how to verify a group, we now apply the method to the most familiar class of examples: additive groups of number systems. These examples are important because they provide the model for many later algebraic structures. In an additive group, the identity element is usually , and the inverse of an element is usually . The main work is to check that the set is closed under addition and that additive inverses remain inside the set. In this lesson, students will verify additive groups such as , , , , and .
Let be a non-empty set with addition . Then is called an if is a group. In additive notation, the identity element is denoted by , and the inverse of is denoted by .
The notation changes slightly in additive groups. Instead of writing the identity as , we usually write it as . Instead of writing the inverse of as , we write it as . This is only a change of notation, not a change of meaning. The inverse condition becomes
Students should not write for an additive inverse unless the context has explicitly chosen multiplicative notation.
For additive groups, the identity is and the inverse of is . Choose a multiple set and an element . The preview checks whether belongs to , displays its additive inverse, and verifies that the inverse remains in the same set. This is the key membership step in additive group proofs.
Visual laboratory
Dynamic Sandbox
Let be the set of integers under ordinary addition. Then is a group.
Given that is the set of integers and is ordinary addition. To prove that is a group. [1] To prove closure. Let . Then
Therefore is closed under addition. [2] To prove associativity. Let . Then
Therefore addition is associative on . [3] To prove the existence of identity element. There exists such that
Therefore is the identity element of . [4] To prove the existence of inverse elements. Let . Then and
Therefore every element of has an additive inverse in . Hence, is a group.
Let . If , then is a group under ordinary addition.
Given that and . To prove that is a group. [1] To prove closure. Let . Then there exist such that
Now
Since , we get . [2] To prove associativity. Let . Since addition of integers is associative,
[3] To prove the existence of identity element. Since , we get . Also
Therefore is the identity element. [4] To prove the existence of inverse elements. Let . Then there exists such that . Now
Since , we get . Also
Therefore every element of has an additive inverse in . Hence, is a group.
The proof for is a useful model because it shows how to use the internal form of the elements. If , then must be written as for some integer . This representation is the key to proving closure and inverse membership. For example, the inverse of under addition is , and this again belongs to . This type of argument will appear repeatedly when proving that subsets form groups.
The following are additive groups: [1] is a group because the sum and negative of rational numbers are rational, and . [2] is a group because the sum and negative of real numbers are real, and . [3] is a group because the sum and negative of complex numbers are complex, and . Hence, these standard number systems are groups under addition.
Prove that is a group.
Let . To prove that is a group. [1] To prove closure. Let . Then there exist such that
Now
Since , we get . [2] To prove associativity. Let . Since integer addition is associative,
[3] To prove identity element. Since , we get . Also
[4] To prove inverse elements. Let . Then for some . Now
Since , we get . Also
Hence, is a group.
Not every subset of a number system forms an additive group. For example, under addition is not a group if because it does not contain the additive identity . Also, under addition is not a group because and . Thus additive group examples require careful membership checks.
Use the calculator below to test additive inverse membership for sets of the form . Enter an integer and an element . If belongs to , the calculator checks whether also belongs to . This illustrates the inverse step in the proof of additive groups.
Interactive calculator
[1] Prove that is a group. [2] Determine whether is a group. [3] Determine whether is a group. [4] Find the additive inverse of in . [5] Determine whether is a group.
[1] If and , then . The identity is , and the inverse of is . [2] No. The element has no additive inverse in . [3] Yes. Rational numbers are closed under addition, addition is associative, is the identity, and is rational for every rational . [4] The additive inverse is . [5] No. Closure fails because and .
Questions to consolidate
Continue learning
Continue to multiplicative groups of nonzero numbers, where identity and inverses are written in multiplicative notation.