Tour:Interdisciplinary problems three (beginners): Difference between revisions

From Groupprops
 
(8 intermediate revisions by the same user not shown)
Line 1: Line 1:
{{guided tour|beginners|Introduction three|Introduction four (beginners)|Confidence aggregator three (beginners)}}
{{tour-special|
target = beginners|
secnum = three|
pagetype = Interdisciplinary problems|
next = Examples peek three (beginners)|
previous = Hard nuts three (beginners)|
next secnum = four|
previous secnum = two}}


The problems here relate ideas in group theory to ideas in other subjects. Learners who already have some experience with the other subjects may try these problems to cement their understanding of what has been learned in parts one and two of the tour. Moreover, these problems build on themes introduced in [[Tour:Interdisciplinary problems two (beginners)]], so a review of those problems may be helpful.
The problems here relate ideas in group theory to ideas in other subjects. Learners who already have some experience with the other subjects may try these problems to cement their understanding of what has been learned in parts one and two of the tour. Moreover, these problems build on themes introduced in [[Tour:Interdisciplinary problems two (beginners)]], so a review of those problems may be helpful.
Line 29: Line 36:
# '''NEEDS SOME THOUGHT''': If <math>U</math> is an open subset of <math>G</math>, prove that the subgroup generated by <math>U</math> is an open subgroup of <math>G</math>
# '''NEEDS SOME THOUGHT''': If <math>U</math> is an open subset of <math>G</math>, prove that the subgroup generated by <math>U</math> is an open subgroup of <math>G</math>
# Use the previous problem and an earlier exercise to '''deduce that''' if <math>G</math> is a connected group, it is generated by any nonempty open subset.
# Use the previous problem and an earlier exercise to '''deduce that''' if <math>G</math> is a connected group, it is generated by any nonempty open subset.
# Define the '''closed subgroup generated''' by a subset <math>S</math> in a topological group <math>G</math> to be the intersection of all closed subsets of <math>G</math> containing <math>S</math>. '''Prove that''' the closed subgroup generated by <math>S</math> is the same as the closure (in a topological sense) of the subgroup generated by <math>S</math>.
# '''NEEDS SOME THOUGHT''': '''Prove that''' the closure (in a topological sense) of a subgroup of a group must also be a subgroup.
# '''NEEDS SOME THOUHT''': Define the '''closed subgroup generated''' by a subset <math>S</math> in a topological group <math>G</math> to be the intersection of all closed subgroups of <math>G</math> containing <math>S</math>. '''Prove that''' the closed subgroup generated by <math>S</math> is the same as the closure (in a topological sense) of the subgroup generated by <math>S</math>.
# (''For those who have seen groups of motions in Euclidean space'') '''NEEDS LOT OF THOUGHT''': '''Prove that''' a join of two closed subgroups of a topological group need not be closed. (An explicit example can be constructed using reflections about lines at an irrational angle)
# (''For those who have seen groups of motions in Euclidean space'') '''NEEDS LOT OF THOUGHT''': '''Prove that''' a join of two closed subgroups of a topological group need not be closed. (An explicit example can be constructed using reflections about lines at an irrational angle)


Line 47: Line 55:


where each <math>H_i</math> is measurable, and <math>G</math> is the union of the <math>H_i</math>s, then there exists some <math>n</math> for which <math>G = H_n</math>.
where each <math>H_i</math> is measurable, and <math>G</math> is the union of the <math>H_i</math>s, then there exists some <math>n</math> for which <math>G = H_n</math>.
==Other algebraic structures==
===Quasigroups===
# '''Prove that''' if <math>H</math> is a proper subquasigroup of a finite quasigroup, then the size of <math>H</math> is at most half the size of <math>G</math>. (''Hint'': Use the fact that multiplying any element outside <math>H</math> with any element inside <math>H</math> gives an element outside <math>H</math>.) {{further|[[Subquasigroup of size more than half is whole quasigroup]]}}
# '''Prove that''' if <math>H</math> is a proper subquasigroup of an infinite quasigroup <math>G</math>, then the complement <math>G \setminus H</math> is infinite. {{further|[[Proper subquasigroup of infinite quasigroup is coinfinite]]}}


==Combinatorics==
==Combinatorics==
Line 52: Line 67:
===Sidon subsets===
===Sidon subsets===


# A subset <math>S</math> of an Abelian group <math>G</math> is termed a Sidon subset (we studied these in [[Tour:Interdisciplinary problems two (beginners)|interdisciplinary problems]]. A maximal Sidon subset is a Sidon subset not properly contained in a bigger Sidon subset. Prove that a maximal Sidon subset cannot completely be contained inside a coset of a proper subgroup.
# A subset <math>S</math> of an Abelian group <math>G</math> is termed a Sidon subset (we studied these in [[Tour:Interdisciplinary problems two (beginners)|interdisciplinary problems two]]). A maximal Sidon subset is a Sidon subset not properly contained in a bigger Sidon subset. '''Prove that''' a maximal Sidon subset cannot completely be contained inside a coset of a proper subgroup.


===Fibonacci sequences===
===Fibonacci sequences===
Line 58: Line 73:
# A Fibonacci sequence in an Abelian group <math>G</math> is defined as follows. <math>f_0</math> and <math>f_1</math> are defined as arbitrary elements of <math>G</math>, and <math>f_n</math> is defined inductively as <math>f_{n-1} + f_{n-2}</math>. '''Prove that''' any Fibonacci sequence in <math>G</math> lies inside the subgroup generated by <math>f_0</math> and <math>f_1</math>.
# A Fibonacci sequence in an Abelian group <math>G</math> is defined as follows. <math>f_0</math> and <math>f_1</math> are defined as arbitrary elements of <math>G</math>, and <math>f_n</math> is defined inductively as <math>f_{n-1} + f_{n-2}</math>. '''Prove that''' any Fibonacci sequence in <math>G</math> lies inside the subgroup generated by <math>f_0</math> and <math>f_1</math>.


{{guided tour|beginners|Introduction three|Introduction four (beginners)|Confidence aggregator three (beginners)}}
==Universal algebra==
 
===Number of generators needed to express a law===
 
The axiomatization for groups includes ''associativity'', that needs universal quantification over three elements. Can we get an axiomatization that does ''not'' require quantification over three elements? We explore this and related questions here.
 
# Suppose a variety of algebras can be described using a collection of universal identities where no identity requires universal quantification over more than <math>n</math> elements. '''Prove that''' an algebra with the required operations is ''in'' the variety if and only if for any <math>n</math> elements of the algebra, there is a subalgebra of the algebra containing those <math>n</math> elements, that is in the variety.
# '''NEEDS LOT OF THOUGHT''': '''Construct''' a magma that is ''not'' a semigroup, but with the property that the submagma generated by any two elements is a semigroup. Using this, show that the variety of semigroups ''cannot'' be axiomatized with laws having fewer than three universally quantified elements.
# '''NEEDS LOT OF THOUGHT''': '''Construct''' an algebra loop that is ''not'' a group, but with the property that the subloop generated by any two elements is a subgroup. Using this, show that the variety of groups ''cannot'' be axiomatized with laws having fewer than three universally quantified elements.
 
===Permutational invariance of laws===
 
Given a binary operation, we can consider the ''opposite'' binary operation: a binary operation that acts on the inputs in the reverse. <math>*</math> and <math>\cdot</math> are ''opposite'' if <math>x * y = y \cdot x</math> for all <math>x</math> and <math>y</math>.
 
# '''Prove that''' a binary operation is commutative if and only if it equals the opposite operation.
# '''Prove that''' a binary operation is associative if and only if the opposite operation is associative.
# '''Prove that''' a binary operation admits a two-sided neutral element if and only if the opposite operation does, and that the neutral element is the same for both. (Note: In fact, left neutral elements for a binary operation are right neutral for the opposite operation).
# '''Prove that''' a binary operation is left-cancellative if and only if the opposite operation is right-cancellative.
# '''Prove that''' an element is left-invertible for a binary operation if and only if it is right-invertible for the opposite binary operation.
 
In other words, all the laws we have used are preserved on passing to the opposite operation. Thus:
 
# '''Prove that''' a magma is a semigroup if and only if its opposite magma is.
# '''Prove that''' a magma is a monoid if and only if its opposite magma is.
# '''Prove that''' a magma is a group if and only if its opposite magma is.
# '''Prove that''' a magma is a quasigroup if and only if its opposite magma is.
 
{{tour-special|
target = beginners|
secnum = three|
pagetype = Interdisciplinary problems|
next = Examples peek three (beginners)|
previous = Hard nuts three (beginners)|
next secnum = four|
previous secnum = two}}

Latest revision as of 00:22, 21 February 2010

This page is a Interdisciplinary problems page, part of the Groupprops guided tour for beginners (Jump to beginning of tour)
PREVIOUS: Hard nuts three (beginners)| UP: Introduction three | NEXT: Examples peek three (beginners)
PREVIOUS SECTION Interdisciplinary problems: Interdisciplinary problems two|NEXT SECTION Interdisciplinary problems: Interdisciplinary problems four
General instructions for the tour | Pedagogical notes for the tour | Pedagogical notes for this part

The problems here relate ideas in group theory to ideas in other subjects. Learners who already have some experience with the other subjects may try these problems to cement their understanding of what has been learned in parts one and two of the tour. Moreover, these problems build on themes introduced in Tour:Interdisciplinary problems two (beginners), so a review of those problems may be helpful.

Topology

A topological group is a set G with a topology as well as a group structure, so that the inverse map is continuous with respect to the topology, and the multiplication map is continuous as a map from G×G to G.

We'll need to remember the following facts about topological groups:

  • For a topological group G and an element gG, the left multiplication by g, given by xgx, is a homeomorphism. It sends open subsets to open subsets and closed subsets to closed subsets. Similarly, right multiplication by g is a homeomorphism.
  • An arbitrary union of open subsets of a topological space is open.
  • A finite intersection of open subsets of a topological space is open.
  • The subset of a topological space is closed if and only if its complement is open.

Cosets, intersections, open and closed

  1. Prove that if a subgroup of a group is open (resp., closed) so is every left and right coset of the subgroup.
  2. Prove that any open subgroup of a topological group is closed.
  3. Prove that any closed subgroup of finite index in a topological group is open.
  4. Prove that if HKG are groups, with G a topological group, and H open in G, then K is open in G.
  5. Prove that if HKG are groups, with G a topological group, [K:H] finite, and H closed in G, then K is closed in G.
  6. (For those who know connectedness) Prove that in a connected topological group, there is no proper open subgroup, and every proper closed subgroup has infinite index.
  7. (For those who know compactness) Prove that in a compact topological group, every open subgroup has finite index.
  8. Prove that an arbitrary intersection of closed subgroups is closed.

Subgroup generated

  1. NEEDS SOME THOUGHT: If U is an open subset of G, prove that the subgroup generated by U is an open subgroup of G
  2. Use the previous problem and an earlier exercise to deduce that if G is a connected group, it is generated by any nonempty open subset.
  3. NEEDS SOME THOUGHT: Prove that the closure (in a topological sense) of a subgroup of a group must also be a subgroup.
  4. NEEDS SOME THOUHT: Define the closed subgroup generated by a subset S in a topological group G to be the intersection of all closed subgroups of G containing S. Prove that the closed subgroup generated by S is the same as the closure (in a topological sense) of the subgroup generated by S.
  5. (For those who have seen groups of motions in Euclidean space) NEEDS LOT OF THOUGHT: Prove that a join of two closed subgroups of a topological group need not be closed. (An explicit example can be constructed using reflections about lines at an irrational angle)

Measure theory

A left-invariant measure μ on a group G is a measure with the property that for any gG, the map xgx is a measure-preserving transformation. In other words, for any measurable subset S of G, gS is measurable and μ(gS)=μ(S).

In the exercises, we shall assume that G is a group with left-invariant measure μ, and we will further assume that μ(G) is finite.

Lagrange's theorem and applications

  1. Prove that if H is a measurable subgroup of G, then μ(H)[G:H]=μ(G). In other words, the index of H in G equals the ratio of the measure of G to the measure of H.
  2. Prove that if H is a proper measurable subgroup of G, then μ(H)12μ(G).
  3. NEEDS SOME THOUGHT: Prove that if we have an ascending chain of subgroups of G:

H0H1H2

where each Hi is measurable, and G is the union of the His, then there exists some n for which G=Hn.

Other algebraic structures

Quasigroups

  1. Prove that if H is a proper subquasigroup of a finite quasigroup, then the size of H is at most half the size of G. (Hint: Use the fact that multiplying any element outside H with any element inside H gives an element outside H.) Further information: Subquasigroup of size more than half is whole quasigroup
  2. Prove that if H is a proper subquasigroup of an infinite quasigroup G, then the complement GH is infinite. Further information: Proper subquasigroup of infinite quasigroup is coinfinite

Combinatorics

Sidon subsets

  1. A subset S of an Abelian group G is termed a Sidon subset (we studied these in interdisciplinary problems two). A maximal Sidon subset is a Sidon subset not properly contained in a bigger Sidon subset. Prove that a maximal Sidon subset cannot completely be contained inside a coset of a proper subgroup.

Fibonacci sequences

  1. A Fibonacci sequence in an Abelian group G is defined as follows. f0 and f1 are defined as arbitrary elements of G, and fn is defined inductively as fn1+fn2. Prove that any Fibonacci sequence in G lies inside the subgroup generated by f0 and f1.

Universal algebra

Number of generators needed to express a law

The axiomatization for groups includes associativity, that needs universal quantification over three elements. Can we get an axiomatization that does not require quantification over three elements? We explore this and related questions here.

  1. Suppose a variety of algebras can be described using a collection of universal identities where no identity requires universal quantification over more than n elements. Prove that an algebra with the required operations is in the variety if and only if for any n elements of the algebra, there is a subalgebra of the algebra containing those n elements, that is in the variety.
  2. NEEDS LOT OF THOUGHT: Construct a magma that is not a semigroup, but with the property that the submagma generated by any two elements is a semigroup. Using this, show that the variety of semigroups cannot be axiomatized with laws having fewer than three universally quantified elements.
  3. NEEDS LOT OF THOUGHT: Construct an algebra loop that is not a group, but with the property that the subloop generated by any two elements is a subgroup. Using this, show that the variety of groups cannot be axiomatized with laws having fewer than three universally quantified elements.

Permutational invariance of laws

Given a binary operation, we can consider the opposite binary operation: a binary operation that acts on the inputs in the reverse. * and are opposite if x*y=yx for all x and y.

  1. Prove that a binary operation is commutative if and only if it equals the opposite operation.
  2. Prove that a binary operation is associative if and only if the opposite operation is associative.
  3. Prove that a binary operation admits a two-sided neutral element if and only if the opposite operation does, and that the neutral element is the same for both. (Note: In fact, left neutral elements for a binary operation are right neutral for the opposite operation).
  4. Prove that a binary operation is left-cancellative if and only if the opposite operation is right-cancellative.
  5. Prove that an element is left-invertible for a binary operation if and only if it is right-invertible for the opposite binary operation.

In other words, all the laws we have used are preserved on passing to the opposite operation. Thus:

  1. Prove that a magma is a semigroup if and only if its opposite magma is.
  2. Prove that a magma is a monoid if and only if its opposite magma is.
  3. Prove that a magma is a group if and only if its opposite magma is.
  4. Prove that a magma is a quasigroup if and only if its opposite magma is.

This page is a Interdisciplinary problems page, part of the Groupprops guided tour for beginners (Jump to beginning of tour)
PREVIOUS: Hard nuts three (beginners)| UP: Introduction three | NEXT: Examples peek three (beginners)
PREVIOUS SECTION Interdisciplinary problems: Interdisciplinary problems two|NEXT SECTION Interdisciplinary problems: Interdisciplinary problems four
General instructions for the tour | Pedagogical notes for the tour | Pedagogical notes for this part