Algebra 4 | Groups

A group can be defined with surprisingly little structure: start with a set and a binary operation that is associative, plus only a left identity and left inverses—and the full group axioms (including a two-sided identity and two-sided inverses) follow automatically. That matters because it lets mathematicians work with weaker assumptions while still guaranteeing the same algebraic behavior needed for applications like symmetry and reversible moves.

The lesson begins by motivating groups through familiar examples. Integers under addition form a classic group, but the same idea also fits “movement” systems such as the Rubik’s Cube: any sequence of moves can be undone to return to the starting state, matching the group requirement that every element has an inverse and that there is a neutral element. The takeaway is that groups aren’t limited to numbers; they describe reversible transformations.

Next comes the formal setup. A semigroup is a set with an associative binary operation. For a group, the minimal assumptions are: (1) associativity, (2) a left identity element e (so e acts neutrally on the left), and (3) left inverses (for each a in the set, there exists some b in the set with b·a = e). The instructor emphasizes that e is not assumed to be a right identity, and b is not assumed to be a right inverse—those are the missing pieces.

From there, the core proof shows that the missing group properties can be deduced. Associativity is already in place from the semigroup condition. The key work is proving that every left inverse is also a right inverse and that the left identity is also a right identity. The argument fixes an arbitrary element a and uses its given left inverse b (so b·a = e). By inserting e as a left identity in a strategic way and applying associativity, the proof derives that a·b behaves like a neutral element relative to a. Then it introduces a left inverse for the product a·b and uses associativity again to conclude that a·b must equal e. This upgrades b from a left inverse to a two-sided inverse.

With two-sided inverses established, the proof turns to the identity element. To show e is also right neutral, it checks that a·e = a. The calculation replaces e by b·a (using the already known left inverse relation), then uses associativity to rearrange parentheses into (a·b)·a. Since a·b has already been shown to equal e, the expression collapses back to a. Because a was arbitrary, e is confirmed as a full identity element.

The final conclusion is practical: if a structure satisfies associativity plus a left identity and left inverses, it automatically satisfies the standard group axioms. That means definitions can be weakened without changing the resulting algebraic structure—an approach that becomes useful in later videos when deriving further properties and working through examples.