Course Problems
Home
Problems
Assign Problems
Organize
Assign Problems
Add Problems
Solution Progress
TikZ Images
Compare
Difficulty
Banger Rating
PDF Management
Ctrl+S
Edit Problem
Year
Paper
Question Number
Course
-- Select Course --
LFM Pure
LFM Pure and Mechanics
LFM Stats And Pure
UFM Additional Further Pure
UFM Mechanics
UFM Pure
UFM Statistics
zNo longer examinable
Section
-- Select Section --
Coordinate Geometry
Simultaneous equations
Proof
Proof by induction
Introduction to trig
Modulus function
Matrices
Linear transformations
Invariant lines and eigenvalues and vectors
Trigonometry 2
Small angle approximation
Differentiation
Integration
Implicit equations and differentiation
Differential equations
3x3 Matrices
Exponentials and Logarithms
Arithmetic and Geometric sequences
Differentiation from first principles
Integration as Area
Vectors
Constant Acceleration
Non-constant acceleration
Newton's laws and connected particles
Pulley systems
Motion on a slope
Friction
Momentum and Collisions
Moments
Parametric equations
Projectiles
Quadratics & Inequalities
Curve Sketching
Polynomials
Binomial Theorem (positive integer n)
Functions (Transformations and Inverses)
Partial Fractions
Generalised Binomial Theorem
Complex Numbers (L8th)
Combinatorics
Measures of Location and Spread
Probability Definitions
Tree Diagrams
Principle of Inclusion/Exclusion
Independent Events
Conditional Probability
Discrete Probability Distributions
Uniform Distribution
Binomial Distribution
Geometric Distribution
Hypergeometric Distribution
Negative Binomial Distribution
Modelling and Hypothesis Testing
Hypothesis test of binomial distributions
Data representation
Continuous Probability Distributions and Random Variables
Continuous Uniform Random Variables
Geometric Probability
Normal Distribution
Approximating Binomial to Normal Distribution
Solving equations numerically
Newton-Raphson method
Sequences and Series
Number Theory
Vector Product and Surfaces
Groups
Reduction Formulae
Moments
Work, energy and Power 1
Momentum and Collisions 1
Centre of Mass 1
Circular Motion 1
Momentum and Collisions 2
Work, energy and Power 2
Centre of Mass 2
Circular Motion 2
Dimensional Analysis
Variable Force
Simple Harmonic Motion
Sequences and series, recurrence and convergence
Roots of polynomials
Polar coordinates
Conic sections
Taylor series
Hyperbolic functions
Integration using inverse trig and hyperbolic functions
Vectors
First order differential equations (integrating factor)
Complex numbers 2
Second order differential equations
Discrete Random Variables
Poisson Distribution
Approximating the Poisson to the Normal distribution
Approximating the Binomial to the Poisson distribution
Probability Generating Functions
Cumulative distribution functions
Exponential Distribution
Bivariate data
Linear regression
Moment generating functions
Linear combinations of normal random variables
Central limit theorem
Hypothesis test of a normal distribution
Hypothesis test of Pearson’s product-moment correlation coefficient
Hypothesis test of Spearman’s rank correlation coefficien
Hypothesis test of a Poisson distribution
The Gamma Distribution
Chi-squared distribution
Yates’ continuity correction
Non-parametric tests
Wilcoxon tests
Moments of inertia
Worksheet Citation (for copying)
Click the copy button or select the text to copy this citation for use in worksheets.
Problem Text
Let $(G,*)$ and $(H,\circ)$ be two groups and $G\times H$ be the set of ordered pairs $(g,h)$ with $g\in G$ and $h\in H.$ A multiplication on $G\times H$ is defined by \[ (g_{1},h_{1})(g_{2},h_{2})=(g_{1}*g_{2},h_{1}\circ h_{2}) \] for all $g_{1},g_{2}\in G$ and $h_{1},h_{2}\in H$. Show that, with this multiplication, $G\times H$ is a group. State whether the following are true or false and prove your answers. \begin{questionparts} \item $G\times H$ is abelian if and only if both $G$ and $H$ are abelian. \item $G\times H$ contains a subgroup isomorphic to $G$. \item $\mathbb{Z}_{2}\times\mathbb{Z}_{2}$ is isomorphic to $\mathbb{Z}_{4}.$ \item $S_{2}\times S_{3}$ is isomorphic to $S_{6}.$ \end{questionparts} {[}$\mathbb{Z}_{n}$ is the cyclic group of order $n$, and $S_{n}$ is the permutation group on $n$ objects.{]}
Solution (Optional)
Claim: $G \times H$ is a group. (Called the product group). Proof: Checking the group axioms: \begin{enumerate} \item (Closure) is inherited from $G$ and $H$, since $g_1 * g_2 \in G$ and $h_1 \circ h_2 \in H$ \item (Associativity) \begin{align*} (g_1, h_1)\l (g_2, h_2)(g_3,h_3)\r &= (g_1, h_1)(g_2 *g_3, h_2 \circ h_3) \\ &= (g_1*(g_2 *g_3), h_1 \circ (h_2 \circ h_3)) \\ &= ((g_1*g_2) *g_3), (h_1 \circ h_2) \circ h_3) \\ &= (g_1*g_2, h_1 \circ h_2)(g_3, h_3) \\ &= \l(g_1, h_1)(g_2, h_2) \r(g_3,h_3) \end{align*} \item (Identity) Consider $(e_G, e_H)$, then $(e_G, e_H)(g,h) = (g,h) = (g,h)(e_G, e_H)$ \item (Inverses) If $(g,h) \in G \times H$ then consider $(g^{-1}, h^{-1})$ and we have $(g^{-1}, h^{-1})(g,h) = (e_G,e_H) = (g,h)(g^{-1}, h^{-1})$ \end{enumerate} \begin{itemize} \item Claim: $G \times H$ is abelian iff $G$ and $H$ are. Proof: $\Rightarrow$ Suppose $g_1, g_2 \in G$ and $h_1, h_2 \in H$ then $(g_1, g_2)(h_1,h_2) = (g_1 * g_2, h_1 \circ h_2) = (h_1,h_2)(g_1, g_2) = (g_2 * g_1, h_2 \circ h_1)$ so $g_1*g_2 = g_2*g_1$ and $h_1 \circ h_2 = h_2 \circ h_1$, therefore $G$ and $H$ are commutative. $\Leftarrow$ If $H$ and $G$ are commutative then: $(g_1, g_2)(h_1,h_2) = (g_1 * g_2, h_1 \circ h_2) = (g_2 * g_1, h_2 \circ h_1) = (h_1,h_2)(g_1, g_2)$ so $G \times H$ is commutative. \item Claim: $G\times H$ contains a subgroup isomorphic to $G$. Consider the subset $S = \{(g,e_H) : g \in G \}$. Then this is a subgroup isomorphic to $G$ with isomorphism given by $\phi : S \to G$ by $\phi((g,e_H)) = g$ \item If $x \in \mathbb{Z}_2 \times \mathbb{Z}_2$ then $x^2 = e$, but $1$ does not have order 2 in $\mathbb{Z}_4$ \item $S_2 \times S_3$ has order $2 \times 6 = 12$. $S_6$ has order $6! \neq 12$ \item \end{itemize}
Preview
Problem
Solution
Update Problem
Cancel
Current Ratings
Difficulty Rating:
1500.0
Difficulty Comparisons:
0
Banger Rating:
1500.0
Banger Comparisons:
0
Search Problems
Press Enter to search, Escape to close