Geometric Bites

What Is an Isomorphism? In mathematics, an isomorphism is a function that shows two mathematical objects have the same structure. Although the objects may look different, an isomorphism demonstrates that they behave in exactly the same way with respect to the operations that define them. If such a map exists, the objects are called isomorphic . An isomorphism tells us that two systems are essentially the same, differing only by a relabelling of their elements. The Basic Idea An isomorphism is a function: f : A → B that must be: Injective — different elements of A map to different elements of B. Surjective — every element of B comes from some element of A. Together these mean f is bijective , and so it has an inverse: f⁻¹ : B → A No information is lost moving from A to B or back. Preserving Structure Bijectivity alone is not enough. An isomorphism must also preserve structure. For groups, this means: f(a ⋆ b) = f(a) ∘ f(b) for all a, b ∈ A ,...

What Is a Group in Mathematics? In abstract algebra, a group is a set G together with a binary operation (written as * ). The pair (G, *) is called a group when the operation satisfies the four conditions below. Closure: for all g₁, g₂ ∈ G , the product g₁ * g₂ is still in G . Identity: there exists an element e ∈ G such that for all g ∈ G , e * g = g * e = g . This element e is called the identity. Inverses: for each g ∈ G there exists an element g⁻¹ ∈ G such that g * g⁻¹ = g⁻¹ * g = e . Associativity: for all g₁, g₂, g₃ ∈ G , g₁ * (g₂ * g₃) = (g₁ * g₂) * g₃ . These four conditions are exactly what is required for (G, *) to be a group. Side note: Commutativity An operation is commutative if swapping the elements does not change the result: a * b = b * a . Commutativity is not required for a group to exist. It is important not to confuse commutativity with associativity . These are distinct i...