2.2.6. Let S be a subset of a group G, and let S^-1 denote
{s^-1: s...
2.2.6. Let S be a subset of a group G, and let S^-1 denote
{s^-1: s ∈ S}.
Show that 〈S^-1〉 = 〈S 〉. In particular, for a ∈ G, 〈a〉 = 〈a^-1〉, so
also
o(a) =o(a^-1)
Let G be an abelian group and K is a subset of G.
if K is a subgroup of G , show that G is finitely generated if
and only if both K and G/K are finitely generated.
Let G be a group acting on a set S, and let H be a group acting
on a set T. The product group G × H acts on the disjoint union S ∪
T as follows. For all g ∈ G, h ∈ H,
s ∈ S and t ∈ T,
(g, h) · s = g · s, (g, h) · t = h · t.
(a) Consider the groups G = C4, H = C5,
each acting...
Problem 2. Let N denote the non-measurable
subset of [0, 1], constructed in class and in the book "Real
Analysis: Measure Theory, Integration, and Hilbert Spaces" by E. M.
Stein, R. Shakarchi.
(a) Prove that if E is a measurable subset of N , then m(E) =
0.
(b) Assume that G is a subset of R with m∗(G) > 0,
prove that there is a subset of G such that it is
non-measurable.
(c) Prove that if Nc =...
Let (G,·) be a finite group, and let S be a set with the same
cardinality as G. Then there is a bijection μ:S→G . We can give a
group structure to S by defining a binary operation *on S, as
follows. For x,y∈ S, define x*y=z where z∈S such that μ(z) =
g_{1}·g_{2}, where μ(x)=g_{1} and μ(y)=g_{2}.
First prove that (S,*) is a group.
Then, what can you say about the bijection μ?
Let Rx denote the group of nonzero real numbers under
multiplication and let R+ denote the group of positive
real numbers under multiplication. Let H be the subgroup {1, −1} of
Rx. Prove that Rx ≈ R+ ⊕ H.
Let S denote the 10-element set {a,b,c,d,e,f,g,h,i,j}. How many
ways can we construct a subset of S of size 7 ? 120 How many ways
can we construct a subset of S of size 7 containing the element j?
84 How many ways can we construct a subset of S of size 7
containing i but not j ? 28 How many ways can we construct a subset
of S of size 7 containing h but neither i nor j...
Let (F, <) be an ordered field, let S be a nonempty subset of
F, let c ∈ F, and for purposes of this problem let cS = {cx | x ∈
S}. (Do not use this notation outside this problem without defining
what you mean by the notation.) Assume that c > 0.
(i) Show that an element b ∈ F is an upper bound for S if and
only if cb is an upper bound for cS.
(ii)...
Let G be a group and a be an element of G. Let φ:Z→G be a map
defined by φ(n) =a^{n} for all n∈Z. a)Show that φ is a group
homomorphism. b) Find the image ofφ, i.e.φ(Z), and prove that it is
a subgroup ofG.
Let
G be a finite group and H a subgroup of G. Let a be an element of G
and aH = {ah : h is an element of H} be a left coset of H. If b is
an element of G as well and the intersection of aH bH is non-empty
then aH and bH contain the same number of elements in G. Thus
conclude that the number of elements in H, o(H), divides the number
of elements...