Difference between revisions of "Set subtraction"
From Maths
(Created page with "==Definition== Given two sets, {{M|A}} and {{M|B}} we define ''set subtraction'' as follows: * {{M|1=A-B=\{x\in A\vert x\notin B\} }} ==Other names== * Relative complement **...") |
m (Making navbox plain) |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
| + | {{Stub page|Cleanup and further expansion}} | ||
| + | {{Requires references}} | ||
==Definition== | ==Definition== | ||
| − | Given two sets, {{M|A}} and {{M|B}} we define ''set subtraction'' as follows: | + | Given two sets, {{M|A}} and {{M|B}} we define ''set subtraction'' ({{AKA}}: ''relative complement''{{rMTH}}) as follows: |
* {{M|1=A-B=\{x\in A\vert x\notin B\} }} | * {{M|1=A-B=\{x\in A\vert x\notin B\} }} | ||
| − | == | + | ===Alternative forms=== |
| − | * Relative complement | + | {{Begin Inline Theorem}} |
| − | ** This comes from the | + | * {{M|1=A-B=(A^c\cup B)^c}} |
| + | {{Begin Inline Proof}} | ||
| + | {{Requires proof|Be bothered to do this}} | ||
| + | {{End Proof}}{{End Theorem}} | ||
| + | ==Terminology== | ||
| + | * '''Relative complement'''<ref name="MTH"/> | ||
| + | ** This comes from the idea of a [[complement]] of a subset of {{M|X}}, say {{M|A}} being just {{M|X-A}}, so if we have {{M|A,B\in\mathcal{P}(X)}} then {{M|A-B}} can be thought of as the complement of {{M|B}} if you consider it relative (to be in) {{M|A}}. | ||
==Notations== | ==Notations== | ||
Other notations include: | Other notations include: | ||
* {{M|A\setminus B}} | * {{M|A\setminus B}} | ||
| − | == | + | ==Trivial expressions for set subtraction== |
{{Begin Inline Theorem}} | {{Begin Inline Theorem}} | ||
| − | + | '''Claim:''' {{M|1=(A-B)-C=A-(B\cup C)}} | |
{{Begin Inline Proof}} | {{Begin Inline Proof}} | ||
| − | {{Todo| | + | '''Proof:''' |
| + | * Note that {{M|1=A-B=(A^c\cup B)^c}} so {{M|1=(A-B)-C = ((A-B)^c\cup B)^c =(((A^c\cup B)^c)^c\cup C)^c}} | ||
| + | ** But: {{M|1=(A^c)^c=A}} so: | ||
| + | *** {{M|1=(A-B)-C=(A^c\cup B\cup C)^c=(A^c\cup(B\cup C))^c=A-(B\cup C)}} | ||
| + | {{Todo|Make this proof neat}} | ||
{{End Proof}}{{End Theorem}} | {{End Proof}}{{End Theorem}} | ||
| + | |||
==See also== | ==See also== | ||
* [[Set complement]] | * [[Set complement]] | ||
==References== | ==References== | ||
<references/> | <references/> | ||
| − | {{ | + | {{Set operations navbox|plain}} |
{{Definition|Set Theory}} | {{Definition|Set Theory}} | ||
{{Theorem Of|Set Theory}} | {{Theorem Of|Set Theory}} | ||
| + | [[Category:Set operations]] | ||
Latest revision as of 00:48, 21 March 2016
(Unknown grade)
This page is a stub
This page is a stub, so it contains little or minimal information and is on a to-do list for being expanded.The message provided is:
Cleanup and further expansion
(Unknown grade)
This page requires references, it is on a to-do list for being expanded with them.
Please note that this does not mean the content is unreliable, it just means that the author of the page doesn't have a book to hand, or remember the book to find it, which would have been a suitable reference.
Contents
[hide]Definition
Given two sets, A and B we define set subtraction (AKA: relative complement[1]) as follows:
- A−B={x∈A|x∉B}
Alternative forms
Terminology
- Relative complement[1]
- This comes from the idea of a complement of a subset of X, say A being just X−A, so if we have A,B∈P(X) then A−B can be thought of as the complement of B if you consider it relative (to be in) A.
Notations
Other notations include:
- A∖B
Trivial expressions for set subtraction
[Expand]
Claim: (A−B)−C=A−(B∪C)
See also
References
| ||||||||
Categories:
- Stub pages
- Pages requiring references
- Pages requiring references of unknown grade
- Pages requiring proofs
- Pages requiring proofs of unknown grade
- Todo
- Definitions
- Set Theory Definitions
- Set Theory
- Theorems
- Theorems, lemmas and corollaries
- Set Theory Theorems
- Set Theory Theorems, lemmas and corollaries
- Set operations
