Geometric Bites

Injective, Surjective, and Bijective Functions In mathematics, a function describes how elements of one set are assigned to elements of another. Three important properties capture how completely and uniquely a function connects its domain to its codomain: injective , surjective , and bijective . These properties tell us whether different inputs can share the same output and whether every possible output is used. Injective (One-to-One) A function is injective if different inputs always produce different outputs. No two distinct elements in the domain are allowed to map to the same result in the codomain. Formally, a function f : A → B is injective if: f(a₁) = f(a₂) ⇒ a₁ = a₂ Equivalently, if a₁ ≠ a₂ , then f(a₁) ≠ f(a₂) . Example: f(x) = e x from ℝ → ℝ is injective. Different inputs produce different outputs, but not every real number is reached, so it is not surjective. Surjective (Onto) A function is surjective if every element of the codomain is reach...

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...