Cyclic Groups, Generators, and Cyclic Subgroups | Abstract Algebra

This section covers two fundamental methods for proving a subset is a subgroup. The two-step subgroup test requires proving closure under the operation and closure under inverses, with the proof showing that associativity is inherited and the identity exists because x*x⁻¹ = e must be in H. The one-step subgroup test provides a unified condition: for all a, b ∈ H, a*b⁻¹ ∈ H. This single condition encapsulates both closure requirements. The proof demonstrates that this guarantees the identity exists (by setting a = b = x), inverses exist (by setting a = e), and closure under the operation (by setting b = y⁻¹). Examples include logarithms of positive rationals under addition and integer powers of 2 under multiplication.

To prove that a non-empty subset H satisfying 'for all a in H, a⁻¹ in H' is a subgroup: (1) Identity exists: Take a in H, then a⁻¹ in H, so a*a⁻¹ = e in H. (2) Inverses exist: Given, by assumption. (3) Closure: For a,b in H, a⁻¹ and b⁻¹ are in H, so (a*b)⁻¹ = b⁻¹*a⁻¹ is in H, implying a*b in H. (4) Associativity: Inherited from G. Thus H satisfies all group properties.

A subgroup is a non-empty subset H of a group G that satisfies all group properties under the same operation. Key requirements include: non-emptiness, closure under the operation, existence of identity element, and existence of inverses. Examples include Q being a subgroup of R under addition, while N is not a subgroup of Z because it lacks the identity element. Matrix groups like GL(n,R) (non-singular matrices) and SL(n,R) (matrices with determinant 1) form groups and subgroups respectively. Trivial subgroups are G itself and the identity set {e}. Two methods determine if H is a subgroup: the one-step test requires that for all a,b in H, both ab and a⁻¹ must be in H; the two-step test requires closure (ab in H) and inverses (a⁻¹ in H). Associativity is automatically satisfied since H inherits it from G. The identity element e is always in H because for any a in H, a·a⁻¹ = e must be in H by closure.

An alternative subgroup test states that a non-empty subset H of a group G is a subgroup if and only if for every a, b in H, the element a × b⁻¹ is also in H. This one-step condition is equivalent to the three conditions of Theorem 1.12. The video proves both directions: if H is a subgroup, then a × b⁻¹ is in H (since b⁻¹ is in H and H is closed); if a × b⁻¹ is in H for all a, b, then all three conditions of Theorem 1.12 are satisfied.

The Two-Step Subgroup Test is a method to verify if a subset of a group is a subgroup. The test requires satisfying two essential conditions: (1) Closure Property - for any two elements in the subset, their product must also be in the subset; (2) Inverse Property - for every element in the subset, its inverse must also be in the subset. Additionally, the identity element of the original group must be present in the subset. These conditions ensure the subset maintains the group structure and forms a valid subgroup.

This comprehensive section covers fundamental number theory concepts essential for solving mathematical problems. Key topics include: (1) GCD properties: GCD(a²-b², a²+b²) is 1 or 2 depending on parity; if a|b and b|a, then a=b; GCD(a/b, b/a)=1 when GCD(a,b)=d; (2) Modular arithmetic: squares are 0 or 1 mod 5; cubes are 0, 1, or 6 mod 7; (3) Fermat's Little Theorem: a^(p-1)≡1 (mod p) for prime p not dividing a; (4) Divisibility rules: sum of digits determines divisibility by 3; (5) Division Algorithm: a=bq+r with 0≤r<b, with unique quotient and remainder; (6) LCM of relatively prime numbers equals their product. These concepts form the foundation for advanced number theory.

This section covers three foundational concepts in number theory. First, divisibility: a number 'a' divides 'b' if there exists an integer 'q' such that b = a × q. Second, Euclidean division: for any integers 'a' and 'b' (b ≠ 0), there exist unique integers 'q' (quotient) and 'r' (remainder) such that a = b × q + r, where 0 ≤ r < |b|. Third, the greatest common divisor (PGCD): the largest positive integer that divides both 'a' and 'b' simultaneously. These concepts form the basis for understanding more advanced arithmetic operations and algorithms.

Number theory is the branch of mathematics studying integer properties, including divisibility, modular arithmetic, GCD, and LCM. Modular arithmetic deals with remainders when dividing by a number, forming the basis for many number theory techniques. The Chinese Remainder Theorem allows solving systems of congruences with pairwise coprime moduli. A number is divisible by 100 if and only if it is divisible by both 4 and 25, since 100 = 4 × 25 and these are coprime. This principle allows breaking down complex divisibility problems into simpler components.

This video introduces core number theory concepts essential for cryptography and computer science: (1) Divisibility - a divides b if b = ac for some integer c; (2) Division Algorithm - any integer a can be expressed as dq + r where 0 ≤ r < d; (3) Congruence Modulo m - a ≡ b mod m means m divides (a-b); (4) Prime Numbers - integers greater than 1 with only 1 and themselves as factors; (5) Fundamental Theorem of Arithmetic - every integer >1 has a unique prime factorization; (6) Greatest Common Divisor (GCD) - largest integer dividing both a and b; (7) Least Common Multiple (LCM) - smallest positive integer divisible by both a and b; (8) Relationship: a×b = gcd(a,b)×lcm(a,b).

This comprehensive lesson covers fundamental number theory concepts. The greatest common divisor (GCD) is the largest positive integer dividing two numbers without remainder. A number 'd' is a common divisor of 'a' and 'b' if it divides both without remainder, and it must divide any linear combination of 'a' and 'b'. To simplify fractions, divide numerator and denominator by their GCD. The Euclidean algorithm finds GCD by repeatedly applying division: given 'a' and 'b' (a > b), divide 'a' by 'b' to get remainder, then replace 'a' with 'b' and 'b' with remainder until remainder is zero. In modular arithmetic, 'a ≡ b (mod n)' means 'n' divides 'a - b', so 'a' and 'b' leave the same remainder when divided by 'n'. Congruence is an equivalence relation with reflexivity, symmetry, and transitivity properties.

Groups use two notational conventions. Additive notation uses '+' for operation, '0' for neutral element, '-a' for inverse, and 'n·a' for n-fold application. Multiplicative notation uses '·' or juxtaposition for operation, '1' for neutral element, 'a⁻¹' for inverse, and 'aⁿ' for n-fold application. These are purely conventional notations that do not imply the operation is actual addition or multiplication. The inverse of n-fold application equals n-fold application of the inverse element.

Different notations for multiplicative and additive groups: multiplicative uses a·b or ab, identity e or 1, inverse a⁻¹, powers aⁿ; additive uses a + b, identity 0, inverse -a, powers n·a. To convert multiplicative to additive: aⁿ becomes n·a, a⁻ⁿ becomes -n·a, a·b becomes a + b, a⁻¹ becomes -a, a·b⁻¹ becomes a - b. Example: a²·b³·a⁻²·b⁻¹ becomes 2a + 3b - 2a - b = 2b.

Groups use two standard notations: additive notation (for abelian groups) uses + for the operation, 0 for the identity, and -a for the inverse; multiplicative notation uses × or juxtaposition for the operation, 1 for the identity, and a⁻¹ for the inverse. A group is abelian if a ∘ b = b ∘ a for all elements. Examples include integers with addition, real numbers with addition, and the symmetric group Sₙ (all bijections from a set to itself under composition). The same set can form different groups depending on the operation.

Group theory uses two main notations: multiplicative (using powers x^n) and additive (using multiples nx). In multiplicative notation, the cyclic subgroup generated by x is written as <x> = {x^n | n ∈ ℤ}. In additive notation, it becomes <x> = {nx | n ∈ ℤ}. The laws of exponents translate to laws of multiples: nx + mx = (n+m)x. When working with specific examples like the integers ℤ, one must adapt to the operation being used (addition for ℤ, multiplication for abstract groups).

Multiplicative notation uses juxtaposition for product, a⁻¹ for inverse, and 1 for identity. Additive notation uses + for sum, -a for inverse, and 0 for identity. The term 'additive group' implies the group is abelian, while multiplicative notation applies to both abelian and non-abelian groups. Exponentiation extends naturally: in multiplicative notation, aⁿ is n copies of a multiplied together, and a⁻ⁿ is the inverse of aⁿ; in additive notation, na is n copies of a added together, and -na is the negative of na.