Constructing a Larger Collection of Functions

  • Thread starter Thread starter Bashyboy
  • Start date Start date
  • Tags Tags
    Functions
Click For Summary

Homework Help Overview

The discussion revolves around the dihedral groups ##D_3## and ##D_4##, which are defined as collections of functions from the sets ##\{1,2,3\}## and ##\{1,2,3,4\}##, respectively. The original poster is exploring the possibility of constructing a larger collection of functions from these sets while maintaining the structure of a group under function composition.

Discussion Character

  • Exploratory, Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • The original poster initially questions whether it is possible to include additional functions without losing the group properties of ##D_4##. They express uncertainty about their reasoning regarding the exclusion of certain functions. Other participants inquire about the meaning of "constructing a larger family of functions" and whether specific properties must be satisfied by this larger collection.

Discussion Status

The discussion is ongoing, with participants seeking clarification on the original problem statement and exploring the implications of including additional functions. A hint regarding the order of the group of all invertible functions has been provided, suggesting a potential direction for further exploration.

Contextual Notes

The original poster acknowledges that their initial post was incomplete and attempts to clarify their question regarding the construction of a larger group of functions. There is an emphasis on understanding the properties that must be satisfied by this larger collection.

Bashyboy
Messages
1,419
Reaction score
5

Homework Statement


The groups ##D_3## and ##D_4## are actually collections of functions from the sets ##\{1,2,3\}## and ##\{1,2,3,4\}##, respectively, where those integers represent the vertices of the geometric objects. Is it possible to construct a larger collection of functions from these two sets

Homework Equations

The Attempt at a Solution


[/B]
I do not believe this is intended as a rigorous proof, for it is labelled as an "exercise."

At first I thought, "no, it would not be possible, as I actually had to throw away some of the functions/transformations of square in order to get the group ##D_4## because they did not correspond to a rigid transformation of the square." But now I am not so certain this is true; I only threw those other functions/mappings away because they did not correspond to a rigid of the square, but that does not imply that, if they were included in the set ##D_4##, ##D_4## would no longer be a group. If those other functions were included, it most certainly would not be the group of rigid transformation of a square, but that does not mean it is not a group.

Could someone help contrive an approach to solving this problem?
 
Physics news on Phys.org
Thanks for the post! Sorry you aren't generating responses at the moment. Do you have any further information, come to any new conclusions or is it possible to reword the post?
 
What do you mean by "construct a larger family of functions". "Construct" in what sense? Does this larger family of functions have to satisfy some property?
 
I am sorry. Now that I look back at my original post, I realize that it was very incomplete. Let me try restating the problem a little better.

##D_3## and ##D_4## are two of the dihedral groups, which are actually functions from the set ##\{1,2,3\}## and ##\{1,2,3,4\}## to themselves, respectively, with composition as the group operation. Is it possible to construct a larger collection of functions from these two sets, again with composition as the group operation, and would it still form a larger group?
 
Hint: what is the order of the group of all invertible functions from a finite set to itself?
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
Replies
8
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
9
Views
4K
Replies
4
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K