Isomorphism Article Index for
Isomorphism 		Articles about
Isomorphism 		Website Links For
Isomorphism 		 

Information About

Isomorphism
  CATEGORIES ABOUT ISOMORPHISM
   
functions and mappings
   
abstract algebra
   
algebra
   
category theory
   
APPAREL
BABY
BEAUTY
BOOKS
CAR TOYS
CELL PHONES
DVD'S
ELECTRONICS
GOURMET FOOD
GROCERIES
HEALTH & PERSONAL
HOME & GARDEN
JEWELRY
MUSIC
MUSIC INSTRUMENTS
OFFICE PRODUCTS
SOFTWARE
SPORTING GOODS
TOOLS & HARDWARE
TOYS
VIDEO GAMES
SHOPPING HOME
MORE SHOPPING...



In map ''f'' such that both ''f'' and its Inverse ''f'' −1 are Homomorphism s, i.e. ''structure-preserving'' mappings.

Informally, an isomorphism is a kind of Mapping between objects, which shows a relationship between two properties or operations. If there exists an isomorphism between two structures, we call the two structures isomorphic. In a certain sense, Isomorphic sets are '''structurally identical''', if you choose to ignore finer-grained differences that may arise from how they are defined.

According to Douglas Hofstadter :
:"''The word "isomorphism" applies when two complex structures can be mapped onto each other, in such a way that to each part of one structure there is a corresponding part in the other structure, where "corresponding" means that the two parts play similar roles in their respective structures.''" ( Gödel, Escher, Bach , p. 49)


PURPOSE

Isomorphisms are frequently used by mathematicians to save themselves work. If a good isomorphism can be found from a relatively unknown part of mathematics into some well studied division of mathematics, where many theorems are already proved, and many methods are already available to find answers, then the function can be used to map whole problems out of unfamiliar territory over to "solid ground," where the problem is easier to understand and work with.


PHYSICAL ANALOGIES


Here are some everyday examples of isomorphic structures:

  • A solid cube made of wood and a solid cube made of lead are both solid cubes; although their matter differs, their geometric structures are isomorphic.

  • A standard deck of 52 playing cards with green backs and a standard deck of 52 playing cards with brown backs; although the colours on the backs of each deck differ, the decks are structurally isomorphic — if we wish to play cards, it doesn't matter which deck we choose to use.

  • The Clock Tower in London (that contains Big Ben ) and a wristwatch; although the clocks vary greatly in size, their mechanisms of reckoning time are isomorphic.

  • A six-sided die and a bag from which a number 1 through 6 is chosen; although the method of obtaining a number is different, their random number generating abilities are isomorphic. This is an example of functional isomorphism, without the presumption of geometric isomorphism.



PRACTICAL EXAMPLE


The following are examples of isomorphisms from ordinary Algebra .


  • Consider the function log''b'' maps from the positive Real Number s \mathbb{R}^+ onto the real numbers \mathbb{R}; formally:

    :\log_b : \mathbb{R}^+ o \mathbb{R} \!

    This mapping is One-to-one and Onto , that is, it is a Bijection from the Domain to the Codomain of the logarithm function.

    In addition to being an isomorphism of sets, the logarithm function also preserves certain operations. Specifically, consider the Group (\mathbb{R}^+, imes) of positive real numbers under ordinary multiplication. The logarithm function obeys the following identity:

    :\log_b(x imes y) = \log_b(x) + \log_b(y) \!

    But the real numbers under addition also form a group. So the logarithm function is in fact a group isomorphism from the group (\mathbb{R}^+, imes) to the group (\mathbb{R},+).


  • Consider the group Z6, the numbers from 0 to 5 with addition Modulo 6. Also consider the group Z2 × Z3, the ordered pairs where the ''x'' coordinates can be 0 or 1, and the y coordinates can be 0, 1, or 2, where addition in the ''x''-coordinate is modulo 2 and addition in the ''y''-coordinate is modulo 3.

    These structures are isomorphic under addition, if you identify them using the following scheme:

    ::(0,0) -> 0
    ::(1,1) -> 1
    ::(0,2) -> 2
    ::(1,0) -> 3
    ::(0,1) -> 4
    ::(1,2) -> 5

    or in general (''a'',''b'') -> ( 3''a'' + 4 ''b'' ) mod 6.

    For example note that (1,1) + (1,0) = (0,1) which translates in the other system as 1 + 3 = 4.

    Even though these two sets "look" different, they are indeed isomorphic. More generally, the Direct Product of two Cyclic Group s '''Z'''''n'' and '''Z'''''m'' is cyclic if and only if ''n'' and ''m'' are Coprime .





ABSTRACT EXAMPLES



A relation-preserving isomorphism


For example, if one object consists of a set ''X'' with an ordering ≤ and the other object consists of a set ''Y'' with an ordering \sqsubseteq then an isomorphism from ''X'' to ''Y'' is a bijective function ''f'' : ''X'' → ''Y'' such that
: f(u) \sqsubseteq f(v) Iff ''u'' ≤ ''v''.
Such an isomorphism is called an '' Order Isomorphism ''.


An operation-preserving isomorphism


Suppose that on these sets ''X'' and ''Y'', there are two Binary Operation s \star and \Diamond which happen to constitute the Groups (''X'',\star) and (''Y'',\Diamond). Note that the operators operate on elements from the Domain and Range , respectively, of the "one-to-one" and "onto" function ''f''. There is an isomorphism from ''X'' to ''Y'' if the Bijective function ''f'' : ''X'' → ''Y'' happens to produce results, that sets up a correspondence between the operator \star and the operator \Diamond.

: f(u) \Diamond f(v) = f(u \star v)
for all ''u'', ''v'' in ''X''.


APPLICATIONS

In Abstract Algebra , two basic isomorphisms are defined:

In Analysis , the Legendre Transform maps hard Differential Equations into easier Algebra ic equations.

In Universal Algebra , one can provide a general definition of isomorphism that covers these and many other cases. For a more general definition, see Category Theory .

In Graph Theory , an isomorphism between two graphs ''G'' and ''H'' is a Bijective map ''f'' from the vertices of ''G'' to the vertices of ''H'' that preserves the "edge structure" in the sense that there is an edge from Vertex ''u'' to vertex ''v'' in ''G'' Iff there is an edge from ''f''(''u'') to ''f''(''v'') in ''H''. See Graph Isomorphism .

In Linear Algebra , an isomorphism can also be defined as a Linear Map between two Vector Spaces that is One-to-one and Onto .


SEE ALSO