A familiarity with the notation of sets is essential for the student who wants to read modern literature on finite elements. This handout gives you a brief review of set notation. More details can be found in books on advanced calculus. A set is a well-defined collection of objects. As far as we are concerned, these objects are mainly numbers, vectors, or functions. If an object x {\displaystyle x} is a member of a set A {\displaystyle A} , we write x ∈ A                 ( x   belongs to   A )   . {\displaystyle x\in A~~~~~~~~(x~{\text{belongs to}}~A)~.} If x {\displaystyle x} is not a member of A {\displaystyle A} , we write x ∉ A                 ( x   does not belong to   A )   . {\displaystyle x\notin A~~~~~~~~(x~{\text{does not belong to}}~A)~.} An example of a finite set (of functions) is S = { x , sin ⁡ ( x ) , cos ⁡ ( x ) , exp ⁡ ( x ) , log ⁡ ( x ) }   . {\displaystyle S=\{x,\sin(x),\cos(x),\exp(x),\log(x)\}~.} Another example is the set of integers greater than 5 and less than 12 B = { 6 , 7 , 8 , 9 , 10 , 11 }   . {\displaystyle B=\{6,7,8,9,10,11\}~.} If we denote the set of all integers by Z {\displaystyle \mathbb {Z} } , then we can alternatively write B = { n   |   n ∈ Z , 5 < n < 12 }   . {\displaystyle B=\{n~|~n\in \mathbb {Z} ,5 0 }   . {\displaystyle \mathbb {Z} ^{+}=\{n~|~n\in \mathbb {Z} ,n>0\}~.} An empty (or null) set is a set with no elements. It is denoted by ∅ {\displaystyle \varnothing } . An example is ∅ = { n   |   n ∈ Z + , n < 0 }   = { }   . {\displaystyle \varnothing =\{n~|~n\in \mathbb {Z} ^{+},n<0\}~=\{\}~.} If A {\displaystyle A} and B {\displaystyle B} are two sets, then we say that A {\displaystyle A} is a subset of B {\displaystyle B} if each element of A {\displaystyle A} is an element of B {\displaystyle B} . For example, if the two sets are A = { sin ⁡ ( x ) , cos ⁡ ( x ) }   B = { x , sin ⁡ ( x ) , cos ⁡ ( x ) , exp ⁡ ( x ) , log ⁡ ( x ) }     and     {\displaystyle A=\{\sin(x),\cos(x)\}~B=\{x,\sin(x),\cos(x),\exp(x),\log(x)\}~~{\text{and}}~~} we write A ⊂ B           ( A   is a proper subset of   B )   . {\displaystyle A\subset B~~~~~(A~{\text{is a proper subset of}}~B)~.} On the other hand, if A {\displaystyle A} is a subset of B {\displaystyle B} which may be the set B {\displaystyle B} itself we write A ⊆ B           ( A   is a subset of   B )   . {\displaystyle A\subseteq B~~~~~(A~{\text{is a subset of}}~B)~.} If A {\displaystyle A} is not a subset of B {\displaystyle B} , we write A ⊄ B           ( A   is not a subset of   B )   . {\displaystyle A\not \subset B~~~~~(A~{\text{is not a subset of}}~B)~.} Two sets A {\displaystyle A} and B {\displaystyle B} are equal if they contain exactly the same elements. Thus, A = B ⟺ A ⊆ B   and   B ⊆ A   . {\displaystyle A=B\iff A\subseteq B~{\text{and}}~B\subseteq A~.} The symbol ⟺ {\displaystyle \iff } means if and only if. For example, if A = { x   |   x 2 = 4 }   and   B = { 2 , − 2 } {\displaystyle A=\{x~|~x^{2}=4\}~{\text{and}}~B=\{2,-2\}} then A = B {\displaystyle A=B} . The union of two sets A {\displaystyle A} and B {\displaystyle B} is the set of all elements that are in A {\displaystyle A} or B {\displaystyle B} . C = A ∪ B = { x   |   x ∈ A   or   x ∈ B }   . {\displaystyle C=A\cup B=\{x~|~x\in A~{\text{or}}~x\in B\}~.} The intersection of two sets A {\displaystyle A} and B {\displaystyle B} is the set of all elements that are both in A {\displaystyle A} and in B {\displaystyle B} . D = A ∩ B = { x   |   x ∈ A   and   x ∈ B }   . {\displaystyle D=A\cap B=\{x~|~x\in A~{\text{and}}~x\in B\}~.} The difference of two sets A {\displaystyle A} and B {\displaystyle B} is the set of all elements that are in A {\displaystyle A} but not in B {\displaystyle B} . E = A − B = { x   |   x ∈ A   and   x ∉ B }   . {\displaystyle E=A-B=\{x~|~x\in A~{\text{and}}~x\not \in B\}~.} The complement of a set A {\displaystyle A} (denoted by A ′ {\displaystyle A^{'}} ) is the set of all elements that are not in A {\displaystyle A} but belong to a larger universal set U {\displaystyle U} . A ′ = U − A = { x   |   x ∉ A }   . {\displaystyle A^{'}=U-A=\{x~|~x\not \in A\}~.} Suppose we have a set A {\displaystyle A} . Such a set is called countable if each of its members can be labeled with an integer subscript of the form A = { a 1 , a 2 , a 3 , a 4 , ... }   . {\displaystyle A=\{a_{1},a_{2},a_{3},a_{4},\dots \}~.} Obviously, each finite set is countable. Some infinite sets are also countable. For instance, the set of integers is countable because you can label each integer with an subscript that is also an integer. However, you cannot do that with the real numbers which are uncountable. The set of functions P = { f k   |   f k ( x ) = x k , k = 1 , 2 , ... } {\displaystyle P=\{f_{k}~|~f_{k}(x)=x^{k},k=1,2,\dots \}} is countable. The set of points on the real line A = { x   |   0 ≤ x ≤ 1 } {\displaystyle A=\{x~|~0\leq x\leq 1\}} is not countable because the points cannot be labeled a 1 {\displaystyle a_{1}} , a 2 {\displaystyle a_{2}} , ... {\displaystyle \dots } . The Cartesian product of two sets A {\displaystyle A} and B {\displaystyle B} is the set of all ordered pairs ( a , b ) {\displaystyle (a,b)} , such that A × B = { ( a , b )   |   a ∈ A , b ∈ B }   . {\displaystyle A\times B=\{(a,b)~|~a\in A,b\in B\}~.} In general, A × B ≠ B × A {\displaystyle A\times B\neq B\times A} . For example, if A = { 1 , 5 , 7 }   and   B = { 3 , 6 } {\displaystyle A=\{1,5,7\}~{\text{and}}~B=\{3,6\}} then A × B = { ( 1 , 3 ) , ( 1 , 6 ) , ( 5 , 3 ) , ( 5 , 6 ) , ( 7 , 3 ) , ( 7 , 6 ) } {\displaystyle A\times B=\{(1,3),(1,6),(5,3),(5,6),(7,3),(7,6)\}} and B × A = { ( 3 , 1 ) , ( 3 , 5 ) , ( 3 , 7 ) , ( 6 , 1 ) , ( 6 , 5 ) , ( 6 , 7 ) } ≠ A × B   . {\displaystyle B\times A=\{(3,1),(3,5),(3,7),(6,1),(6,5),(6,7)\}\neq A\times B~.} The set of real numbers ( R {\displaystyle \mathbb {R} ^{}} ) can be visualized as an infinitely long line with each real number being represented as a point on this line. We usually deal with subsets of R {\displaystyle \mathbb {R} ^{}} , called intervals. Let a {\displaystyle a} and b {\displaystyle b} be two points on R {\displaystyle \mathbb {R} ^{}} such that a ≤ b {\displaystyle a\leq b} . Then, The open interval ( a , b ) {\displaystyle (a,b)} is defined as ( a , b ) = { x   |   x ∈ R , a < x < b }   . {\displaystyle (a,b)=\{x~|~x\in \mathbb {R} ,a 0 {\displaystyle \epsilon >0} . Then the neighborhood of p {\displaystyle p} is defined as the open interval nbd ( p ; ε ) := ( p − ε , p + ε ) = { x   |   p − ε < x < p + ε } {\displaystyle {\text{nbd}}(p;\epsilon ):=(p-\epsilon ,p+\epsilon )=\{x~|~p-\epsilon <x<p+\epsilon \}} Let X ⊂ R {\displaystyle X\subset \mathbb {R} ^{}} . Then p {\displaystyle p} is an interior point of X {\displaystyle X} if we can find a nbd( p {\displaystyle p} ) all of whose points belong to X {\displaystyle X} . If every point of X {\displaystyle X} is an interior point, then X {\displaystyle X} is called an open set. For example, the interval ( a , b ) {\displaystyle (a,b)} is an open set. So is the real line R {\displaystyle \mathbb {R} ^{}} . A set X ⊂ R {\displaystyle X\subset \mathbb {R} ^{}} is called closed if its complement X ′ = R − X {\displaystyle X^{'}=\mathbb {R} ^{}-X} is open. The closure X  ̄ {\displaystyle {\bar {X}}} of a set X ⊂ R {\displaystyle X\subset \mathbb {R} ^{}} is the union of the set and its boundary points (a rigorous definition of closed sets can be made using the concept of points of accumulation). The concept of the real line can be extended to higher dimensions. In two dimensions, we have R 2 {\displaystyle \mathbb {R} ^{2}} which is defined as R 2 = R × R = { ( x , y )   |   x , y ∈ R }   . {\displaystyle \mathbb {R} ^{2}=\mathbb {R} ^{}\times \mathbb {R} ^{}=\{(x,y)~|~x,y\in \mathbb {R} ^{}\}~.} R 2 {\displaystyle \mathbb {R} ^{2}} can be thought of as a two-dimensional plane and each member of the set x = ( x , y ) {\displaystyle \mathbf {x} =(x,y)} represents a point on the plane. In three dimensions, we have R 3 = R × R × R = { ( x , y , z )   |   x , y , z ∈ R }   . {\displaystyle \mathbb {R} ^{3}=\mathbb {R} ^{}\times \mathbb {R} ^{}\times \mathbb {R} ^{}=\{(x,y,z)~|~x,y,z\in \mathbb {R} ^{}\}~.} In n {\displaystyle n} dimensions, the concept is extended to mean R n = R × R × R ⋯ × R = { ( x 1 , x 2 , x 3 , ... , x n )   |   x 1 , x 2 , x 3 , ... , x n ∈ R }   . {\displaystyle \mathbb {R} ^{n}=\mathbb {R} ^{}\times \mathbb {R} ^{}\times \mathbb {R} ^{}\dots \times \mathbb {R} ^{}=\{(x_{1},x_{2},x_{3},\dots ,x_{n})~|~x_{1},x_{2},x_{3},\dots ,x_{n}\in \mathbb {R} ^{}\}~.} In the case of sets in R n {\displaystyle \mathbb {R} ^{n}} the concept of distance in R {\displaystyle \mathbb {R} ^{}} is extended so that nbd ( p ; ε ) := { x   |   p ∈ R n , | x − p | < ε } {\displaystyle {\text{nbd}}(\mathbf {p} ;\epsilon ):=\{\mathbf {x} ~|~\mathbf {p} \in \mathbb {R} ^{n},|\mathbf {x} -\mathbf {p} |<\epsilon \}} where | x − p | = ( x 1 − p 1 ) 2 + ( x 2 − p 2 ) 2 + ⋯ + ( x n − p n ) 2   . {\displaystyle |\mathbf {x} -\mathbf {p} |={\sqrt {(x_{1}-p_{1})^{2}+(x_{2}-p_{2})^{2}+\dots +(x_{n}-p_{n})^{2}}}~.} The definition of interior point also follows from the definition in R {\displaystyle \mathbb {R} ^{}} . Thus if Ω ⊂ R n {\displaystyle \Omega \subset \mathbb {R} ^{n}} , then p ∈ R n {\displaystyle p\in \mathbb {R} ^{n}} is an interior point if we can always find a nbd ( p ; ε ) {\displaystyle (p;\epsilon )} , all of whose points belong to Ω {\displaystyle \Omega } . If every point on Ω {\displaystyle \Omega } is an interior point, then Ω {\displaystyle \Omega } is an open set. As in the real number line, a closed set is the complement of an open set. One way of creating a closed set is by taking an open set Ω {\displaystyle \Omega } and its boundary Γ {\displaystyle \Gamma } . This particular closed set is called the closure Ω  ̄ {\displaystyle {\bar {\Omega }}} of Ω {\displaystyle \Omega } . A rigorous definition can once again be obtained using the concept of points of accumulation. Finite elements Functions →
{'wiki_source': 'wikiversity', 'other_info': "{'content_model': 'wikitext', 'language': 'en', 'title': 'Finite elements/Sets', 'type': 'text'}"}