Main Page: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
mNo edit summary
No edit summary
Line 1: Line 1:
{{Redirect|XOR|the logic gate|XOR gate|other uses|XOR (disambiguation)}}
{{Cleanup-rewrite|several issues are raised on the discussion page|date=March 2013}}
{{Refimprove|date=January 2012}}
{| style="background: #f9f9f9; border: 1px solid #cccccc;" align="right"
|-
| [[File:Venn0110.svg|220px]]
|-
| [[Venn diagram]] of <math>\scriptstyle A \oplus B</math><br>
[[File:Venn0111.svg|35px|OR]] but not [[File:Venn0001.svg|35px|AND]] is [[File:Venn0110.svg|35px|XOR]]
|-
| [[File:Venn 0110 1001.svg|220px]]
|-
| [[Venn diagram]] of <math>\scriptstyle A \oplus B \oplus C</math><br>
[[File:Venn 0110 0110.svg|40px]] <math>~\oplus~</math> [[File:Venn 0000 1111.svg|40px]] <math>~\Leftrightarrow~</math> [[File:Venn 0110 1001.svg|40px]]
|}


The [[Logical connective|logical operation]] '''exclusive disjunction''', also called '''exclusive or''' ([[Table of logic symbols|symbolized]] by the prefix operator '''J''', or by the infix operators '''XOR''', '''EOR''', '''EXOR''', '''<font size="4">⊻</font>''' or '''<font size="5">⊕</font>''', {{IPAc-en|icon|ˌ|ɛ|k|s|_|ˈ|ɔr}} or {{IPAc-en|ˈ|z|ɔr}}), is a type of [[logical disjunction]] on two [[operands]] that results in a value of [[Boolean_data_type|true]] if exactly one of the operands has a value of true.<ref>See ''[[Stanford Encyclopedia of Philosophy]]'', article ''[http://plato.stanford.edu/entries/disjunction/ Disjunction]''</ref> A simple way to state this is "one or the other but not both."
{{Group theory sidebar |Basics}}


Put differently, exclusive disjunction is a logical operation on two [[logical value]]s, typically the values of two [[proposition]]s, that produces a value of ''true'' only in cases where the [[truth value]] of the operands differ.
In [[mathematics]], a [[group (mathematics)|group]] ''G'' is called the '''direct sum''' <ref>Homology. Saunders MacLane. Springer, Berlin; Academic Press, New York, 1963.</ref><ref>László Fuchs. Infinite Abelian Groups</ref> of two [[subgroup]]s ''H''<sub>''1''</sub> and ''H''<sub>''2''</sub> if
* each ''H''<sub>''1''</sub> and ''H''<sub>''2''</sub> are [[normal subgroup]]s of ''G''
* the subgroups ''H''<sub>''1''</sub> and ''H''<sub>''2''</sub> have [[Trivial group|trivial intersection]] (i.e., having only the [[identity element]] <math>e</math> in common), and
* ''G'' = <''H''<sub>''1''</sub>, ''H''<sub>''2''</sub>>; in other words, ''G'' is [[generating set of a group|generated]] by the subgroups ''H''<sub>''1''</sub> and ''H''<sub>''2''</sub>.


The opposite of XOR is [[logical biconditional]], where the output of two compared values is true only if both A and B are the same.
More generally, ''G'' is called the  direct sum of a finite set of [[subgroup]]s {''H''<sub>''i''</sub>} if
* each ''H''<sub>''i''</sub> is a [[normal subgroup]] of ''G''
* each ''H''<sub>''i''</sub> has trivial intersection with the subgroup  <{''H''<sub>''j''</sub> : ''j'' not equal to ''i''}>, and
* ''G'' = <{''H''<sub>''i''</sub>}>; in other words, ''G'' is [[generating set of a group|generated]] by the subgroups {''H''<sub>''i''</sub>}.


==Truth table==
If ''G'' is the direct sum of subgroups ''H'' and ''K'', then we write ''G'' = ''H'' + ''K''; if ''G'' is the direct sum of a set of subgroups {''H''<sub>''i''</sub>}, we often write ''G'' = ∑''H''<sub>''i''</sub>. Loosely speaking, a direct sum is [[isomorphism|isomorphic]] to a weak direct product of subgroups.
[[File:Multigrade operator XOR.svg|thumb|220px|Arguments on the left combined by XOR<br>This is a binary [[Walsh matrix]]<br>(compare: [[Hadamard code]])]]
The [[truth table]] of <math>~A \oplus B</math> (also written as <math>A\, \mathrm{XOR}\, B</math> or <math>A \neq B</math>) is as follows:


{| class="wikitable" style="text-align:center"
In [[abstract algebra]], this method of construction can be generalized to direct sums of [[vector space]]s, [[module (mathematics)|modules]], and other structures; see the article [[direct sum of modules]] for more information.
|+ XOR Truth Table
|-
!colspan="2" | Input || rowspan="2" | Output
|-
!A || B
|-
| 0 || 0 || 0
|-
| 0 || 1 || 1
|-
| 1 || 0 || 1
|-
| 1 || 1 || 0
|}


==Equivalencies, elimination, and introduction==
This notation is [[commutative]]; so that in the case of the direct sum of two subgroups, ''G'' = ''H'' + ''K'' = ''K'' + ''H''. It is also [[associative]] in the sense that if ''G'' = ''H'' + ''K'', and ''K'' = ''L'' + ''M'', then ''G'' = ''H'' + (''L'' + ''M'') = ''H'' +  ''L'' + ''M''.
Exclusive disjunction essentially means 'either one, but not both'. In other words, [[if and only if]] one is true, the other cannot be true. For example, one of the two horses will win the race, but not both of them. The exclusive disjunction :<math>p \oplus q</math>, or J''pq'', can be expressed in terms of the [[logical conjunction]] (<math>\wedge</math>), the [[disjunction]] (<math>\lor</math>), and the [[negation]] (<math>\lnot</math>) as follows:
: <math>\begin{matrix}
p \oplus q & = & (p \land \lnot q) \lor (\lnot p \land q)
\end{matrix}</math>


The exclusive disjunction <math>p \oplus q</math> can also be expressed in the following way:
A group which can be expressed as a direct sum of non-trivial subgroups is called ''decomposable''; otherwise it is called ''indecomposable''.
: <math>\begin{matrix}
p \oplus q & = & \lnot (p \land q) \land (p \lor q)
\end{matrix}</math>


This representation of XOR may be found useful when constructing a circuit or network, because it has only one <math>\lnot</math> operation and small number of <math>\wedge</math> and <math>\lor</math> operations. The proof of this identity is given below:
If ''G'' = ''H'' + ''K'', then it can be proven that:
: <math>\begin{matrix}
p \oplus q & = & (p \land \lnot q) & \lor & (\lnot p \land q) \\
& = & ((p \land \lnot q) \lor \lnot p) & \and & ((p \land \lnot q) \lor q) \\
& = & ((p \lor \lnot p) \land (\lnot q \lor \lnot p)) & \land & ((p \lor q) \land (\lnot q \lor q)) \\
& = & (\lnot p \lor \lnot q) & \land & (p \lor q) \\
& = & \lnot (p \land q) & \land & (p \lor q)
\end{matrix}</math>


It is sometimes useful to write <math>p \oplus q</math> in the following way:
* for all ''h'' in ''H'', ''k'' in ''K'', we have that ''h''*''k'' = ''k''*''h''
: <math>\begin{matrix}
* for all ''g'' in ''G'', there exists unique ''h'' in ''H'', ''k'' in ''K'' such that ''g'' = ''h''*''k''
p \oplus q & = & \lnot ((p \land q) \lor (\lnot p \land \lnot q))
* There is a cancellation of the sum in a quotient; so that (''H'' + ''K'')/''K'' is isomorphic to ''H''
\end{matrix}</math>


This equivalence can be established by applying [[De Morgan's laws]] twice to the fourth line of the above proof.
The above assertions can be generalized to the case of ''G'' = ∑''H''<sub>''i''</sub>, where {''H''<sub>i</sub>} is a finite set of subgroups.


The exclusive or is also equivalent to the negation of a [[logical biconditional]], by the rules of material implication (a [[material conditional]] is equivalent to the disjunction of the negation of its [[Antecedent (logic)|antecedent]] and its consequence) and [[If and only if|material equivalence]].
* if ''i'' ≠ ''j'', then for all ''h''<sub>''i''</sub> in ''H''<sub>''i''</sub>, ''h''<sub>''j''</sub> in ''H''<sub>''j''</sub>, we have that ''h''<sub>''i''</sub> * ''h''<sub>''j''</sub> = ''h''<sub>''j''</sub> * ''h''<sub>''i''</sub>
* for each ''g'' in ''G'', there unique set of {''h''<sub>''i''</sub> in ''H''<sub>''i''</sub>} such that
:''g'' = ''h''<sub>1</sub>*''h''<sub>2</sub>* ... * ''h''<sub>''i''</sub> * ... * ''h''<sub>''n''</sub>
* There is a cancellation of the sum in a quotient; so that ((∑''H''<sub>''i''</sub>) + ''K'')/''K'' is isomorphic to ∑''H''<sub>''i''</sub>


In summary, we have, in mathematical and in engineering notation:
Note the similarity with the [[direct product of groups|direct product]], where each ''g'' can be expressed uniquely as
: <math>\begin{matrix}
:''g'' = (''h''<sub>1</sub>,''h''<sub>2</sub>, ..., ''h''<sub>''i''</sub>, ..., ''h''<sub>''n''</sub>)
p \oplus q & = & (p \land \lnot q) & \lor & (\lnot p \land q) & = & p\overline{q} + \overline{p}q \\
\\
      & = & (p \lor q) & \land & (\lnot p \lor \lnot q) & = & (p+q)(\overline{p}+\overline{q}) \\
\\
      & = & (p \lor q) & \land & \lnot (p \land q) & = & (p+q)(\overline{pq})
\end{matrix}</math>


==Relation to modern algebra==
Since ''h''<sub>''i''</sub> * ''h''<sub>''j''</sub> = ''h''<sub>''j''</sub> * ''h''<sub>''i''</sub> for all ''i'' ≠ ''j'', it follows that multiplication of elements in a direct sum is isomorphic to multiplication of the corresponding elements in the direct product; thus for finite sets of subgroups, ∑''H''<sub>''i''</sub> is isomorphic to the direct product &times;{''H''<sub>''i''</sub>}.


Although the [[Operation (mathematics)|operators]] <math>\wedge</math> ([[Logical conjunction|conjunction]]) and <math>\lor</math> ([[Logical disjunction|disjunction]]) are very useful in logic systems, they fail a more generalizable structure in the following way:
==Direct summand==
Given a group <math>G</math>, we say that a subgroup <math>H</math> is a '''direct summand''' of <math>G</math> (or that '''splits''' form <math>G</math>) if and only if there exist another subgroup <math>K\leq G</math> such that <math>G</math> is the direct sum of the subgroups <math>H</math>  and <math>K</math>


The systems <math>(\{T, F\}, \wedge)</math> and <math>(\{T, F\}, \lor)</math> are [[monoid]]s. This unfortunately prevents the combination of these two systems into larger structures, such as a [[Ring (mathematics)|mathematical ring]].
In abelian groups, if <math>H</math> is a [[Divisible group|divisible subgroup]] of <math>G</math> then <math>H</math> is a direct summand of <math>G</math>.


However, the system using exclusive or <math>(\{T, F\}, \oplus)</math> '''is''' an [[abelian group]].  The combination of operators <math>\wedge</math> and <math>\oplus</math> over elements <math>\{T, F\}</math> produce the well-known [[field (mathematics)|field]] [[GF(2)|<math>F_2</math>]].  This field can represent any logic obtainable with the system <math>(\land, \lor)</math> and has the added benefit of the arsenal of algebraic analysis tools for fields.
==Examples==


More specifically, if one associates <math>F</math> with 0 and <math>T</math> with 1, one can interpret the logical "AND" operation as multiplication on <math>F_2</math> and the "XOR" operation as addition on <math>F_2</math>:
* If we take
:<math> G= \prod_{i\in I} H_i </math> it is clear that <math> G </math> is the direct product of the subgroups <math> H_{i_0} \times \prod_{i\not=i_0}H_i</math>.


<math>\begin{matrix}
* If <math>H</math> is a [[Divisible group|divisible subgroup]] of an abelian group <math> G </math>. Then there exist another subgroup <math>K\leq G </math> such that  <math>G=K+H </math>
r = p \land q & \Leftrightarrow & r = p \cdot q \pmod 2 \\
\\
r = p \oplus q & \Leftrightarrow & r = p + q \pmod 2 \\
\end{matrix}</math>


Using this basis to describe a boolean system is referred to as [[algebraic normal form]]
*I <math>G</math> is also a [[vector space]] then <math>G</math> can be writen as a direct sum of <math>\mathbb R</math> and another subespace <math>K</math> that will be isomorphic to the quotient <math>G/K</math>.


==Exclusive "or" in English==
==Equivalence of decompositions into direct sums==
The Oxford English Dictionary explains "either ... or" as follows:
:"The primary function of ''either'', etc., is to emphasize the [[Mutually independent|perfect indifference]] of the two (or more) things or courses ... ; but a secondary function is to emphasize the mutual exclusiveness, = either of the two, but not both."<ref>or, conj.2 (adv.3) 2a ''Oxford English Dictionary'', second edition (1989). OED Online.</ref>


The exclusive-or explicitly states "one or the other, but not neither nor both."
In the decomposition of a finite group into a direct sum of indecomposable subgroups the embedding of the subgroups is not unique; for example, in the [[Klein group]], ''V''<sub>4</sub> = ''C''<sub>2</sub> &times; ''C''<sub>2</sub>, we have that
:''V''<sub>4</sub> = <(0,1)> + <(1,0)> and
:''V''<sub>4</sub> = <(1,1)> + <(1,0)>.


Following this kind of common-sense intuition about "or", it is sometimes argued that in many natural languages, [[English language|English]] included, the word "or" has an "exclusive" sense.  The '''exclusive disjunction''' of a pair of propositions, (''p'', ''q''), is supposed to mean  that ''p'' is true or ''q'' is true, but not both.  For example, it might be argued that the normal intention of a statement like "You may have coffee, or you may have tea" is to stipulate that exactly one of the conditions can be true. Certainly under many circumstances a sentence like this example should be taken as forbidding the possibility of one's accepting both options. Even so, there is good reason to suppose that this sort of sentence is not disjunctive at all. If all we know about some disjunction is that it is true overall, we cannot be sure that either of its disjuncts is true. For example, if a woman has been told that her friend is either at the snack bar or on the tennis court, she cannot validly infer that he is on the tennis court. But if her waiter tells her that she may have coffee or she may have tea, she can validly infer that she may have tea. Nothing classically thought of as a disjunction has this property. This is so even given that she might reasonably take her waiter as having denied her the possibility of having both coffee and tea.{{cn|date=June 2012}}
However, it is the content of the [[Remak-Krull-Schmidt theorem]] that given a finite group ''G'' = ∑''A''<sub>''i''</sub> = ∑''B''<sub>''j''</sub>, where each ''A''<sub>''i''</sub> and each ''B''<sub>''j''</sub> is non-trivial and indecomposable, the two sums have equal terms up to reordering and isomorphism.


(Note: If the waiter intends that choosing neither tea nor coffee is an option i.e. ordering nothing, the appropriate operator is [[logical NAND|NAND]]: p NAND q.)
The Remak-Krull-Schmidt theorem fails for infinite groups; so in the case of infinite ''G'' = ''H'' + ''K'' = ''L'' + ''M'', even when all subgroups are non-trivial and indecomposable, we cannot then assume that ''H'' is isomorphic to either ''L'' or ''M''.


In English, the construct "either ... or" is usually used to indicate exclusive or and "or" generally used for inclusive.  But in Spanish, the word "o" (or) can be used in the form p o q (exclusive) or the form o p o q (inclusive). Formalists may contend that any binary or other [[arity|n-ary]] exclusive "or" is true if and only if it has an odd number of true inputs, and there is no word in English that can conjoin a list of two or more options has this general property.  For example, Barrett and Stenner contend in the 1971 article "The Myth of the Exclusive 'Or{{' "}} (Mind, 80 (317), 116–121) that no author has produced an example of an English or-sentence that appears to be false because both of its inputs are true, and brush off or-sentences such as "The light bulb is either on or off" as reflecting particular facts about the world rather than the nature of the word "or".  However, the "[[barber paradox]]" -- Everybody in town shaves himself or is shaved by the barber, who shaves the barber? -- would not be paradoxical if "or" could not be exclusive (although a purist could say that "either" is required in the statement of the paradox).
==Generalization to sums over infinite sets==


Whether these examples can be considered "natural language" is another question.  Certainly when one sees a menu stating "Lunch special: sandwich and soup or salad" (parsed as "sandwich and (soup or salad)" according to common usage in the restaurant trade), one would not expect to be permitted to order both soup and salad.  Nor would one expect to order neither soup nor salad, because that belies the nature of the "special", that ordering the two items together is cheaper than ordering them a la carte.  Similarly, a lunch special consisting of one meat, French fries or mashed potatoes and vegetable would consist of three items, only one of which would be a form of potato.  If one wanted to have meat and both kinds of potatoes, one would ask if it were possible to substitute a second order of potatoes for the vegetable.  And, one would not expect to be permitted to have both types of potato and vegetable, because the result would be a vegetable plate rather than a meat plate.{{cn|date=June 2012}}
To describe the above properties in the case where ''G'' is the direct sum of an infinite (perhaps uncountable) set of subgroups, more care is needed.


==Alternative symbols==
If ''g'' is an element of the [[cartesian product]] ∏{''H''<sub>''i''</sub>} of a set of groups, let ''g''<sub>''i''</sub> be the ''i''th element of ''g'' in the product. The '''external direct sum''' of a set of groups {''H''<sub>''i''</sub>} (written as ∑<sub>'''''E'''''</sub>{''H''<sub>''i''</sub>}) is the subset of ∏{''H''<sub>''i''</sub>}, where, for each element ''g'' of ∑<sub>'''''E'''''</sub>{''H''<sub>''i''</sub>}, ''g''<sub>''i''</sub> is the identity <math>e_{H_i}</math> for all but a finite number of ''g''<sub>''i''</sub> (equivalently, only a finite number of ''g''<sub>''i''</sub> are not the identity). The group operation in the external direct sum is pointwise multiplication, as in the usual direct product.
The symbol used for exclusive disjunction varies from one field of application to the next, and even depends on the properties being emphasized in a given context of discussion.  In addition to the abbreviation "XOR", any of the following symbols may also be seen:
* A plus sign (+). This makes sense mathematically because exclusive disjunction corresponds to [[addition]] [[modular arithmetic|modulo]] 2, which has the following addition table, clearly [[isomorphism|isomorphic]] to the one above:


{| align="center"  class="wikitable" style="text-align:center; text-align:center; width:45%"
This subset does indeed form a group; and for a finite set of groups ''H''<sub>''i''</sub>, the external direct sum is identical to the direct product.
|+ '''Addition Modulo 2'''
|- style="background:paleturquoise"
! style="width:15%" | <math>p</math>
! style="width:15%" | <math>q</math>
! style="width:15%" | <math>p + q</math>
|-
| 0 || 0 || 0
|-
| 0 || 1 || 1
|-
| 1 || 0 || 1
|-
| 1 || 1 || 0
|}


* The use of the plus sign has the added advantage that all of the ordinary algebraic properties of mathematical [[ring (mathematics)|rings]] and [[field (mathematics)|fields]] can be used without further ado.  However, the plus sign is also used for Inclusive disjunction in some notation systems.
If ''G'' = ∑''H''<sub>''i''</sub>, then ''G'' is isomorphic to <sub>'''''E'''''</sub>{''H''<sub>''i''</sub>}. Thus, in a sense, the direct sum is an "internal" external direct sum. For each element ''g'' in ''G'', there is a unique finite set ''S'' and unique {''h''<sub>''i''</sub> in ''H''<sub>''i''</sub> : ''i'' in ''S''} such that ''g'' = ∏ {''h''<sub>''i''</sub> : ''i'' in ''S''}.
* A plus sign that is modified in some way, such as being encircled (<math>\oplus</math>).  This usage faces the objection that this same symbol is already used in mathematics for the ''[[Direct sum of modules|direct sum]]'' of algebraic structures.
* A prefixed J, as in J''pq''.
* An inclusive disjunction symbol (<math>\lor</math>) that is modified in some way, such as being underlined (<math>\underline\lor</math>) or with dot above (<math>\dot\vee</math>).
* In several [[programming language]]s, such as [[C (programming language)|C]], [[C++]], [[C Sharp (programming language)|C#]], [[Java (programming language)|Java]], [[Perl]], [[MATLAB]], and [[Python (programming language)|Python]], a [[caret]] (<code>^</code>) is used to denote the bitwise XOR operator. This is not used outside of programming contexts because it is too easily confused with other uses of the caret.
* The symbol [[File:X-or.svg|24px]], sometimes written as >< or as >-<.
* In IEC symbology, an exclusive or is marked "=1".
 
==Properties==
'''[[Commutative property|Commutativity]]: yes'''
{| style="text-align: center; border: 1px solid darkgray;"
|-
|<math>A \oplus B</math>
|&nbsp;&nbsp;&nbsp;&nbsp;<math>\Leftrightarrow</math>&nbsp;&nbsp;&nbsp;&nbsp;
|<math>B \oplus A</math>
|-
|[[File:Venn0110.svg|50px]]
|&nbsp;&nbsp;&nbsp;&nbsp;<math>\Leftrightarrow</math>&nbsp;&nbsp;&nbsp;&nbsp;
|[[File:Venn0110.svg|50px]]
|}
 
'''[[Associative property|Associativity]]: yes'''
{| style="text-align: center; border: 1px solid darkgray;"
|-
|<math>~A</math>
|<math>~~~\oplus~~~</math>
|<math>(B \oplus C)</math>
|&nbsp;&nbsp;&nbsp;&nbsp;<math>\Leftrightarrow</math>&nbsp;&nbsp;&nbsp;&nbsp;
|
|
|<math>(A \oplus B)</math>
|<math>~~~\oplus~~~</math>
|<math>~C</math>
|-
|[[File:Venn 0101 0101.svg|50px]]
|<math>~~~\oplus~~~</math>
|[[File:Venn 0011 1100.svg|50px]]
|&nbsp;&nbsp;&nbsp;&nbsp;<math>\Leftrightarrow</math>&nbsp;&nbsp;&nbsp;&nbsp;
|[[File:Venn 0110 1001.svg|50px]]
|&nbsp;&nbsp;&nbsp;&nbsp;<math>\Leftrightarrow</math>&nbsp;&nbsp;&nbsp;&nbsp;
|[[File:Venn 0110 0110.svg|50px]]
|<math>~~~\oplus~~~</math>
|[[File:Venn 0000 1111.svg|50px]]
|}
 
'''[[Distributive property|Distributivity]]:''' The exclusive or doesn't distribute over any binary function (not even itself),<br>
but logical conjunction (see [[Logical_conjunction#Properties|there]]) distributes over exclusive or.<br>
(Conjunction and exclusive or form the multiplication and addition operations of a [[Field_(mathematics)|field]] [[GF(2)]], and as in any field they obey the distributive law.)
 
'''[[Idempotence|Idempotency]]: no'''<br>
{| style="text-align: center; border: 1px solid darkgray;"
|-
|<math>~A~</math> 
|<math>~\oplus~</math>
|<math>~A~</math>
|&nbsp;&nbsp;&nbsp;&nbsp;<math>\Leftrightarrow</math>&nbsp;&nbsp;&nbsp;&nbsp;
|<math>~0~</math>
|&nbsp;&nbsp;&nbsp;&nbsp;<math>\nLeftrightarrow</math>&nbsp;&nbsp;&nbsp;&nbsp;
|<math>~A~</math>
|-
|[[File:Venn01.svg|36px]]
|<math>~\oplus~</math>
|[[File:Venn01.svg|36px]]
|&nbsp;&nbsp;&nbsp;&nbsp;<math>\Leftrightarrow</math>&nbsp;&nbsp;&nbsp;&nbsp;
|[[File:Venn00.svg|36px]]
|&nbsp;&nbsp;&nbsp;&nbsp;<math>\nLeftrightarrow</math>&nbsp;&nbsp;&nbsp;&nbsp;
|[[File:Venn01.svg|36px]]
|}
 
'''[[Monotonic function#Boolean_functions|Monotonicity]]: no'''
{| style="text-align: center; border: 1px solid darkgray;"
|<math>A \rightarrow B</math>
|&nbsp;&nbsp;&nbsp;&nbsp;<math>\nRightarrow</math>&nbsp;&nbsp;&nbsp;&nbsp;
|
|
|<math>(A \oplus C)</math>
|<math>\rightarrow</math>
|<math>(B \oplus C)</math>
|-
||[[File:Venn 1011 1011.svg|50px]]
|&nbsp;&nbsp;&nbsp;&nbsp;<math>\nRightarrow</math>&nbsp;&nbsp;&nbsp;&nbsp;
||[[File:Venn 1011 1101.svg|50px]]
|&nbsp;&nbsp;&nbsp;&nbsp;<math>\Leftrightarrow</math>&nbsp;&nbsp;&nbsp;&nbsp;
||[[File:Venn 0101 1010.svg|50px]]
|<math>\rightarrow</math>
||[[File:Venn 0011 1100.svg|50px]]
|}
 
'''Truth-preserving: no'''<br>
When all inputs are true, the output is not true.
{| style="text-align: center; border: 1px solid darkgray;"
|-
|<math>A \and B</math>
|&nbsp;&nbsp;&nbsp;&nbsp;<math>\nRightarrow</math>&nbsp;&nbsp;&nbsp;&nbsp;
|<math>A \oplus B</math>
|-
|[[File:Venn0001.svg|50px]]
|&nbsp;&nbsp;&nbsp;&nbsp;<math>\nRightarrow</math>&nbsp;&nbsp;&nbsp;&nbsp;
|[[File:Venn0110.svg|60px]]
|}
 
'''Falsehood-preserving: yes'''<br>
When all inputs are false, the output is false.
{| style="text-align: center; border: 1px solid darkgray;"
|-
|<math>A \oplus B</math>
|&nbsp;&nbsp;&nbsp;&nbsp;<math>\Rightarrow</math>&nbsp;&nbsp;&nbsp;&nbsp;
|<math>A \or B</math>
|-
|[[File:Venn0110.svg|60px]]
|&nbsp;&nbsp;&nbsp;&nbsp;<math>\Rightarrow</math>&nbsp;&nbsp;&nbsp;&nbsp;
|[[File:Venn0111.svg|50px]]
|}
 
'''[[Hadamard transform|Walsh spectrum]]: (2,0,0,-2)'''  
 
'''Non-[[Linear#Boolean functions|linearity]]: 0''' (the function is linear)
 
If using [[binary numeral system|binary]] values for true (1) and false (0), then ''exclusive or'' works exactly like [[addition]] [[Modular arithmetic|modulo]] 2.
 
==Computer science==
[[File:XOR ANSI Labelled.svg|thumb|right|114px|Traditional symbolic representation of an XOR [[logic gate]]]]
 
===Bitwise operation===
{{Main|Bitwise operation}}
[[File:Z2^4; Cayley table; binary.svg|thumb|[[Nimber]] addition is the ''exclusive or'' of [[natural number|nonnegative integers]] in [[w:binary numeral system|binary]] representation. This is also the vector addition in <math>(\Z/2\Z)^4</math>.]]
Exclusive disjunction is often used for bitwise operations. Examples:
* 1 xor 1 = 0
* 1 xor 0 = 1
* 0 xor 1 = 1
* 0 xor 0 = 0
* 1110 xor 1001 = 0111 (this is equivalent to addition without [[carry (arithmetic)|carry]])
 
As noted above, since exclusive disjunction is identical to addition modulo 2, the bitwise exclusive disjunction of two ''n''-bit strings is identical to the standard vector of addition in the [[vector space]] <math>(\Z/2\Z)^n</math>.
 
In computer science, exclusive disjunction has several uses:
* It tells whether two bits are unequal.
* It is an optional bit-flipper (the deciding input chooses whether to invert the data input).
* It tells whether there is an [[Parity (mathematics)|odd]] number of 1&nbsp;bits (<math>A \oplus B \oplus C \oplus D \oplus E</math> is true [[If and only if|iff]] an odd number of the variables are true).
 
In logical circuits, a simple [[adder (electronics)|adder]] can be made with an [[XOR gate]] to add the numbers, and a series of AND, OR and NOT gates to create the carry output.
 
On some computer architectures, it is more efficient to store a zero in a register by xor-ing the register with itself (bits xor-ed with themselves are always zero) instead of loading and storing the value zero.
 
In simple threshold activated [[neural network]]s, modeling the 'xor' function requires a second layer because 'xor' is not a linearly separable function.
 
Exclusive-or is sometimes used as a simple mixing function in [[cryptography]], for example, with [[one-time pad]] or [[Feistel cipher|Feistel network]] systems.
 
Similarly, XOR can be used in generating [[entropy pool]]s for [[hardware random number generator]]s.  The XOR operation preserves randomness, meaning that a random bit XORed with a non-random bit will result in a random bit.  Multiple sources of potentially random data can be combined using XOR, and the unpredictability of the output is guaranteed to be at least as good as the best individual source.<ref>http://www.digipedia.pl/usenet/thread/11834/2075/</ref><ref>http://www.robertnz.net/pdf/xor2.pdf</ref>
 
XOR is used in [[RAID]] 3–6 for creating parity information.  For example, RAID can "back up" bytes <code>10011100</code> and <code>01101100</code> from two (or more) hard drives by XORing (<code>11110000</code>) and writing to another drive.  Under this method, if any one of the three hard drives are lost, the lost byte can be re-created by XORing bytes from the remaining drives.  If the drive containing <code>01101100</code> is lost, <code>10011100</code> and <code>11110000</code> can be XORed to recover the lost byte.
 
XOR is also used to detect an overflow in the result of a signed binary arithmetic operation. If the leftmost retained bit of the result is not the same as the infinite number of digits to the left, then that means overflow occurred. XORing those two bits will give a "1" if there is an overflow.
 
XOR can be used to swap two numeric variables in computers, using the [[XOR swap algorithm]]; however this is regarded as more of a curiosity and not encouraged in practice.
 
In [[computer graphics]], XOR-based drawing methods are often used to manage such items as [[bounding volume|bounding boxes]] and [[cursor (computers)|cursors]] on systems without [[alpha compositing|alpha channels]] or overlay planes.


==See also==
==See also==
*[[direct sum]]
*[[coproduct]]
*[[free product]]
*[[Direct sum of topological groups]]


{{col-begin}}
==References==
{{col-break|width=33%}}
{{Reflist}}
* [[Affirming a disjunct]]
* [[Ampheck]]
* [[Boolean algebra (logic)]]
* [[List of Boolean algebra topics]]
* [[Boolean domain]]
* [[Boolean function]]
* [[Boolean-valued function]]
* [[Controlled NOT gate]]
* [[Disjunctive syllogism]]
{{col-break|width=33%}}
* [[First-order logic]]
* [[Inclusive or]]
* [[involution (mathematics)|Involution]]
* [[Logical graph]]
* [[Logical value]]
* [[Multigrade operator]]
* [[Operation (mathematics)|Operation]]
{{col-break}}
* [[Parametric operator]]
* [[Parity bit]]
* [[Propositional calculus]]
* [[Rule 90]]
* [[Symmetric difference]]
* [[XOR linked list]]
* [[XOR gate]]
* [[XOR cipher]]
{{col-end}}
 
==Notes==
<references/>
 
{{Logical connectives}}
 
==External links==
*[http://www.codeplex.com/rexor An example of XOR being used in cryptography]
 
[[Category:Logic]]
[[Category:Boolean algebra]]
[[Category:Binary operations]]
[[Category:Propositional calculus]]
[[Category:Logical connectives]]


[[ca:Disjunció exclusiva]]
{{DEFAULTSORT:Direct Sum Of Groups}}
[[cs:Exkluzivní disjunkce]]
[[Category:Group theory]]
[[de:Kontravalenz]]
[[et:Välistav disjunktsioon]]
[[es:Disyunción exclusiva]]
[[eo:Logika malinkluziva aŭo]]
[[fa:یای مانعةالجمع]]
[[fr:Fonction OU exclusif]]
[[ko:배타적 논리합]]
[[it:Disgiunzione esclusiva]]
[[he:או מוציא]]
[[mk:Исклучителна дисјункција]]
[[nl:Exclusieve disjunctie]]
[[ja:排他的論理和]]
[[no:Eksklusiv disjunksjon]]
[[pms:Disgionsion esclusiva]]
[[pl:Alternatywa wykluczająca]]
[[pt:Disjunção exclusiva]]
[[ro:Disjuncție exclusivă]]
[[ru:Сложение по модулю 2]]
[[simple:Exclusive disjunction]]
[[sk:Vylučujúce alebo]]
[[tr:XOR kapısı]]
[[uk:Виключна диз'юнкція]]
[[zh:逻辑异或]]

Revision as of 03:51, 10 August 2014

My name is Denice and I am studying American Politics and Greek and Roman Culture at Marseille / France.

Here is my page - Hostgator Coupon [kb.training-classes.com]

Template:Group theory sidebar

In mathematics, a group G is called the direct sum [1][2] of two subgroups H1 and H2 if

More generally, G is called the direct sum of a finite set of subgroups {Hi} if

  • each Hi is a normal subgroup of G
  • each Hi has trivial intersection with the subgroup <{Hj : j not equal to i}>, and
  • G = <{Hi}>; in other words, G is generated by the subgroups {Hi}.

If G is the direct sum of subgroups H and K, then we write G = H + K; if G is the direct sum of a set of subgroups {Hi}, we often write G = ∑Hi. Loosely speaking, a direct sum is isomorphic to a weak direct product of subgroups.

In abstract algebra, this method of construction can be generalized to direct sums of vector spaces, modules, and other structures; see the article direct sum of modules for more information.

This notation is commutative; so that in the case of the direct sum of two subgroups, G = H + K = K + H. It is also associative in the sense that if G = H + K, and K = L + M, then G = H + (L + M) = H + L + M.

A group which can be expressed as a direct sum of non-trivial subgroups is called decomposable; otherwise it is called indecomposable.

If G = H + K, then it can be proven that:

  • for all h in H, k in K, we have that h*k = k*h
  • for all g in G, there exists unique h in H, k in K such that g = h*k
  • There is a cancellation of the sum in a quotient; so that (H + K)/K is isomorphic to H

The above assertions can be generalized to the case of G = ∑Hi, where {Hi} is a finite set of subgroups.

  • if ij, then for all hi in Hi, hj in Hj, we have that hi * hj = hj * hi
  • for each g in G, there unique set of {hi in Hi} such that
g = h1*h2* ... * hi * ... * hn
  • There is a cancellation of the sum in a quotient; so that ((∑Hi) + K)/K is isomorphic to ∑Hi

Note the similarity with the direct product, where each g can be expressed uniquely as

g = (h1,h2, ..., hi, ..., hn)

Since hi * hj = hj * hi for all ij, it follows that multiplication of elements in a direct sum is isomorphic to multiplication of the corresponding elements in the direct product; thus for finite sets of subgroups, ∑Hi is isomorphic to the direct product ×{Hi}.

Direct summand

Given a group , we say that a subgroup is a direct summand of (or that splits form ) if and only if there exist another subgroup such that is the direct sum of the subgroups and

In abelian groups, if is a divisible subgroup of then is a direct summand of .

Examples

  • If we take
it is clear that is the direct product of the subgroups .

Equivalence of decompositions into direct sums

In the decomposition of a finite group into a direct sum of indecomposable subgroups the embedding of the subgroups is not unique; for example, in the Klein group, V4 = C2 × C2, we have that

V4 = <(0,1)> + <(1,0)> and
V4 = <(1,1)> + <(1,0)>.

However, it is the content of the Remak-Krull-Schmidt theorem that given a finite group G = ∑Ai = ∑Bj, where each Ai and each Bj is non-trivial and indecomposable, the two sums have equal terms up to reordering and isomorphism.

The Remak-Krull-Schmidt theorem fails for infinite groups; so in the case of infinite G = H + K = L + M, even when all subgroups are non-trivial and indecomposable, we cannot then assume that H is isomorphic to either L or M.

Generalization to sums over infinite sets

To describe the above properties in the case where G is the direct sum of an infinite (perhaps uncountable) set of subgroups, more care is needed.

If g is an element of the cartesian product ∏{Hi} of a set of groups, let gi be the ith element of g in the product. The external direct sum of a set of groups {Hi} (written as ∑E{Hi}) is the subset of ∏{Hi}, where, for each element g of ∑E{Hi}, gi is the identity for all but a finite number of gi (equivalently, only a finite number of gi are not the identity). The group operation in the external direct sum is pointwise multiplication, as in the usual direct product.

This subset does indeed form a group; and for a finite set of groups Hi, the external direct sum is identical to the direct product.

If G = ∑Hi, then G is isomorphic to ∑E{Hi}. Thus, in a sense, the direct sum is an "internal" external direct sum. For each element g in G, there is a unique finite set S and unique {hi in Hi : i in S} such that g = ∏ {hi : i in S}.

See also

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

  1. Homology. Saunders MacLane. Springer, Berlin; Academic Press, New York, 1963.
  2. László Fuchs. Infinite Abelian Groups