Abstract Algebra IBL Wiki

User Tools

Site Tools

Trace: • why_we_need_associative • examples_of_abstract_groups
problem:the_composition_of_permutations_is_a_permutation

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision 		Previous revision
problem:the_composition_of_permutations_is_a_permutation [2013/11/21 10:15]
tarafife [External links] 		problem:the_composition_of_permutations_is_a_permutation [2013/11/21 10:30] (current)
tarafife
Line 1: Line 1:
 ====== The Composition Of Permutations Is A Permutation ====== ====== The Composition Of Permutations Is A Permutation ======
 ==== Problem ==== ==== Problem ====
-Prove theorem [[Theorem:The Composition Of Permutations Is A Permutation]]).  +Prove theorem [[Theorem:The Composition Of Permutations Is A Permutation]].  
 As some reminders, you may use the following facts that you proved in either Math 301 or Math 340. You may use these facts without proof.   As some reminders, you may use the following facts that you proved in either Math 301 or Math 340. You may use these facts without proof.  
-  - The composition of two injective functions is injective. +  * The composition of two injective functions is injective. 
-  - The composition of two surjective functions is surjective. +  * The composition of two surjective functions is surjective. 
-  - A function is a bijection if it is both injective (1 to 1) and surjective (onto). Hence, the composition of two bijective functions is a bijection.  +  * A function is a bijection if it is both injective (1 to 1) and surjective (onto). Hence, the composition of two bijective functions is a bijection.  
-  - You might find induction helps you get from a composition of two bijective functions is bijective to the composition of $n$ bijective functions is bijective.  +  * You might find induction helps you get from a composition of two bijective functions is bijective to the composition of $n$ bijective functions is bijective.  
  
 ---- ----
Line 23: Line 23:
 Prove theorem [[Theorem:The Composition Of Permutations Is A Permutation]]).   Prove theorem [[Theorem:The Composition Of Permutations Is A Permutation]]).  
 As some reminders, you may use the following facts that you proved in either Math 301 or Math 340. You may use these facts without proof.   As some reminders, you may use the following facts that you proved in either Math 301 or Math 340. You may use these facts without proof.  
-\begin{enumerate}+\begin{itemize}
 \item The composition of two injective functions is injective. \item The composition of two injective functions is injective.
 \item The composition of two surjective functions is surjective. \item The composition of two surjective functions is surjective.
 \item A function is a bijection if it is both injective (1 to 1) and surjective (onto). Hence, the composition of two bijective functions is a bijection.  \item A function is a bijection if it is both injective (1 to 1) and surjective (onto). Hence, the composition of two bijective functions is a bijection. 
-\end{enumerate} +\item You might find induction helps you get from a composition of two bijective functions is bijective to the composition of $n$ bijective functions is bijective.  
-  - You might find induction helps you get from a composition of two bijective functions is bijective to the composition of $n$ bijective functions is bijective.  +\\end{itemize} 
-\end{problem}+end{problem}
 </file> </file>
  
problem/the_composition_of_permutations_is_a_permutation.1385046919.txt.gz · Last modified: 2013/11/21 10:15 by tarafife

Page Tools

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
CC Attribution-Share Alike 4.0 International Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki