Fact-checked by Grok 2 weeks ago

Intersection

In mathematics, the intersection of two sets A and B, denoted A \cap B, is the set consisting of all elements that belong to both A and B.^[1] This operation captures the commonality between sets and forms a fundamental concept in set theory, where the empty set \emptyset results if no elements are shared.^[2] The notation \cap symbolizes this overlap, and it extends naturally to finite or infinite collections of sets.^[3] The intersection operation exhibits several key algebraic properties that mirror those of logical conjunction. It is commutative, meaning A \cap B = B \cap A, and associative, so (A \cap B) \cap C = A \cap (B \cap C).^[4] Additionally, intersection distributes over union: A \cap (B \cup C) = (A \cap B) \cup (A \cap C), and it is idempotent, with A \cap A = A.^[5] These properties ensure that intersections behave consistently in Boolean algebras and underpin proofs in discrete mathematics.^[6] The intersection of a set with itself or the universal set yields the original set, while intersection with the empty set yields \emptyset.^[7] Beyond set theory, intersection applies to geometry, where it denotes the points or regions shared by figures such as lines, planes, or curves. For instance, the intersection of two distinct lines in a plane is a single point if they are not parallel.^[8] In three-dimensional space, the intersection of two planes can be a line, provided they are not parallel or coincident.^[9] These geometric intersections are crucial in computational geometry for tasks like detecting overlaps in polygons or solving line-segment problems.^[10] More advanced applications appear in algebraic geometry, where intersection theory studies the intersections of varieties to compute invariants like degrees and multiplicities.^[11] Intersections also play a vital role in probability and statistics, representing joint events where P(A \cap B) denotes the probability of both A and B occurring.^[2] In logic and computer science, set intersections model "and" operations in predicates and databases, facilitating queries and algorithms.^[12] Overall, the concept of intersection unifies diverse mathematical domains by emphasizing shared structure.

In Set Theory

Definition

In set theory, the intersection of two sets A and B, denoted A \cap B, is the set consisting of all elements that belong to both A and B.^[13] This operation identifies the common elements between the sets, forming a subset of each.^[14] Formally, using set-builder notation, the intersection is defined as

A \cap B = \{ x \mid x \in A \text{ and } x \in B \}.

^[14] Within the lattice of subsets ordered by inclusion, the intersection A \cap B serves as the greatest lower bound of A and B, meaning it is the largest set contained in both.^[15] For example, the intersection of the finite sets \{1, 2, 3\} and \{2, 3, 4\} is \{2, 3\}, as these are the shared elements.^[13] If two sets have no elements in common, such as \{1, 2\} and \{3, 4\}, their intersection is the empty set \emptyset, indicating the sets are disjoint.^[14] This concept presupposes a basic understanding of sets as unordered collections of distinct objects, where membership is the fundamental relation.^[14] Visual representations like Venn diagrams can provide intuition for intersections by shading overlapping regions, though formal definitions rely on membership criteria.^[13]

Properties and Operations

The intersection operation on sets exhibits several fundamental algebraic properties that mirror those of logical conjunction and arithmetic multiplication. It is commutative, meaning that for any sets A and B, A \cap B = B \cap A^[16]. Associativity holds as well, so (A \cap B) \cap C = A \cap (B \cap C) for sets A, B, and C^[16]. Additionally, intersection is idempotent: A \cap A = A for any set A^[17]. Intersection distributes over union, satisfying A \cap (B \cup C) = (A \cap B) \cup (A \cap C) for sets A, B, and C^[16]. Conversely, union distributes over intersection: A \cup (B \cap C) = (A \cup B) \cap (A \cup C)^[16]. These distributive laws underscore the Boolean algebra structure of the power set under union and intersection. In lattice theory, the collection of all subsets of a universal set, ordered by inclusion, forms a distributive lattice where intersection serves as the meet operation (greatest lower bound)^[18]. De Morgan's laws further relate intersection to complements and union: the intersection of two sets is the complement of the union of their complements, i.e., A \cap B = (A^c \cup B^c)^c, where ^c denotes the complement relative to the universal set^[19]. The operation extends naturally to any indexed family of sets (finite or infinite) via the intersection \bigcap_{i \in I} A_i, defined as the set of elements common to every A_i for i \in I, where I is an index set^[20]. This generalization preserves the aforementioned properties, such as associativity, allowing arbitrary groupings. Venn diagrams provide a visual means to verify these properties; for instance, the distributivity of intersection over union with three sets can be illustrated by shading regions that overlap in a way that equates the left and right sides of the equation, confirming the equality through identical shaded areas^[21].

In Geometry

Basic Concepts

In geometry, the intersection of two or more geometric objects is defined as the set of points that belong to all of them simultaneously, such as the common points where lines, curves, planes, or regions overlap.^[13] This concept applies to objects embedded in Euclidean space, where each geometric figure is regarded as a subset of the ambient space, thereby inheriting the properties of set-theoretic intersection, such as commutativity and associativity.^[13] For instance, the intersection of two line segments is either a single point, an entire segment if they coincide, or empty if they do not overlap.^[22] A key aspect of geometric intersections is their dimensionality, which generally decreases compared to the individual objects involved. In an n-dimensional Euclidean space, the intersection of two submanifolds of dimensions k and m (assuming k + m \geq n) typically has dimension k + m - n under conditions of transversality.^[23] For example, two planes, each of dimension 2, in 3-dimensional space intersect in a line of dimension 1, as $2 + 2 - 3 = 1.^[23] This reduction reflects how the constraints imposed by each object constrain the common points. Transversality provides a precise condition for "nice" or generic intersections, where the objects cross properly without tangency or higher-order contact. Specifically, two submanifolds X and Y in an ambient manifold M intersect transversally at a point p \in X \cap Y if the sum of their tangent spaces at p equals the tangent space of M at p, i.e., T_p X + T_p Y = T_p M.^[23] Under this condition, the intersection X \cap Y forms a smooth submanifold of the expected dimension \dim X + \dim Y - \dim M.^[23] Non-transverse intersections, such as a curve tangent to a surface, may result in singularities or unexpected dimensional behavior. Illustrative examples highlight these principles. The intersection of two distinct circles in the plane, each a 1-dimensional curve, consists of at most two points (dimension 0) if they cross transversally, or a single point if tangent, but is empty if they do not overlap.^[24] For filled regions like disks, the intersection forms a lens-shaped area of dimension 2.^[13] Similarly, two parallel lines in the plane have an empty intersection, as they share no points, whereas coincident lines intersect along their entire length.^[22]

Specific Cases in Euclidean Space

In two-dimensional Euclidean space, the intersection of two lines typically yields a single point, which is fundamental in applications such as computer graphics for rendering line crossings and in surveying for determining coordinates. To compute this, lines can be parameterized: a line through point \mathbf{p_1} with direction \mathbf{d_1} is \mathbf{p_1} + t \mathbf{d_1}, and another through \mathbf{p_2} with direction \mathbf{d_2} is \mathbf{p_2} + s \mathbf{d_2}. Setting them equal gives \mathbf{p_1} + t \mathbf{d_1} = \mathbf{p_2} + s \mathbf{d_2}, solved for t and s using the cross product to check non-parallelism: if \mathbf{d_1} \times \mathbf{d_2} \neq 0, then t = \frac{ (\mathbf{p_2} - \mathbf{p_1}) \times \mathbf{d_2} }{ \mathbf{d_1} \times \mathbf{d_2} }, yielding the point \mathbf{p_1} + t \mathbf{d_1}.^[25] For lines in general form ax + by = c and dx + ey = f, the intersection point solves the linear system via Cramer's rule:

x = \frac{ c e - b f }{ a e - b d }, \quad y = \frac{ a f - c d }{ a e - b d },

provided the denominator ae - bd \neq 0, ensuring the lines are not parallel; the magnitude of this determinant is the area of the parallelogram formed by the normal vectors (a, b) and (d, e). This method is widely used in computational geometry for efficient point location.^[26] In three-dimensional Euclidean space, the intersection of two planes, if they are not parallel, forms a line, crucial for tasks like defining edges in 3D modeling and solving systems in engineering. Given planes with normal vectors \mathbf{n_1} and \mathbf{n_2} in Hessian normal form \mathbf{n_1} \cdot \mathbf{x} = p_1 and \mathbf{n_2} \cdot \mathbf{x} = p_2, the direction vector of the intersection line is \mathbf{a} = \mathbf{n_1} \times \mathbf{n_2}, which is perpendicular to both normals. A point \mathbf{x_0} on the line satisfies both plane equations, found by solving the underdetermined system, for example, setting one coordinate to zero if possible and using the cross product for consistency. The parametric equation of the line is then \mathbf{x} = \mathbf{x_0} + t \mathbf{a}. Parallel planes occur when \mathbf{n_1} \times \mathbf{n_2} = \mathbf{0}, yielding no intersection or coincidence.^[27] The intersection of a line and a plane in 3D results in either a single point, the empty set (if parallel and distinct), or the entire line (if contained). Parameterize the line as \mathbf{x} = \mathbf{x_4} + t (\mathbf{x_5} - \mathbf{x_4}), where \mathbf{x_4}, \mathbf{x_5} are points on the line, and the plane passes through \mathbf{x_1}, \mathbf{x_2}, \mathbf{x_3} with normal \mathbf{n} = (\mathbf{x_2} - \mathbf{x_1}) \times (\mathbf{x_3} - \mathbf{x_1}). Substitute into the plane equation \mathbf{n} \cdot (\mathbf{x} - \mathbf{x_1}) = 0, yielding t = \frac{ \mathbf{n} \cdot (\mathbf{x_1} - \mathbf{x_4}) }{ \mathbf{n} \cdot (\mathbf{x_5} - \mathbf{x_4}) } if the denominator (dot product of normal and direction vector) is nonzero, indicating non-parallelism; the intersection point is then \mathbf{x_4} + t (\mathbf{x_5} - \mathbf{x_4}). This computation is essential in ray tracing for graphics and collision detection in simulations.^[28] For algebraic curves in the plane, Bézout's theorem states that two curves of degrees m and n intersect in exactly m n points, counting multiplicities and points at infinity in the projective plane, provided they have no common component; otherwise, they intersect in infinitely many points. This bound arises from considering the resultant of the defining polynomials and is pivotal in enumerative geometry for counting solutions to polynomial systems, such as in robotics for path planning.^[29] Special cases include tangent intersections, where curves touch without crossing, characterized by intersection multiplicity greater than 1: for a curve defined by f(x,y) = 0 and its tangent line at a point P, the multiplicity is the order of contact, often 2 for simple tangency, computed as the dimension of the quotient ring \mathbb{C}[x,y]_{(P)} / (f, l) where l = 0 is the tangent line equation. Parallel non-intersecting cases, such as lines or planes with proportional normals, yield empty intersections by the parallel postulate in Euclidean geometry, where lines in a plane do not meet if their directions are scalar multiples, essential for understanding affine transformations.^[30]^[31]

Notation and Conventions

Standard Symbols

The primary symbol for the intersection of two sets A and B is \cap, which denotes the set of elements common to both. This symbol, resembling an inverted capital U or a lambda-like character, was introduced by Giuseppe Peano in 1888 in his work Calcolo geometrico secondo l'Ausdehnungslehre di H. Grassmann to represent the intersection operation in set theory and geometry.^[32] For the intersection of multiple sets, the binary symbol extends to the n-ary form \bigcap_{i \in I} A_i, where I is an index set, using the large operator \bigcap (Unicode U+22C2). Peano also introduced this larger symbol in 1908 in Formulario mathematico for denoting the general intersection of more than two classes.^[32] Before Peano's introduction of the symbol in 1888, notations such as juxtaposition AB (used by George Boole in 1847 for logical product, analogous to intersection) or a dotted product A \cdot B indicated intersection in Boolean algebraic traditions representing logical conjunction. The symbol \cap itself is encoded as Unicode U+2229 and has become the universal standard in mathematical typography.^[33] In handwriting, \cap is frequently rendered as an inverted U or a V-shaped mark for clarity and speed, though printed forms maintain a consistent rounded appearance. This notation is ubiquitous in introductory mathematics textbooks for set theory and propositional logic, where it first aligns with the conceptual definition of shared elements.^[32]

Field-Specific Variations

In mathematical logic, the intersection of sets finds an analogue in the conjunction of propositions, typically denoted by the wedge symbol ∧, which represents the logical AND operation where both propositions must be true for the conjunction to hold. This notation was introduced by Arend Heyting in 1930 in works on propositional logic, emphasizing the overlapping truth conditions akin to set intersection.^[32] In lattice theory and abstract algebra, the meet operation—corresponding to the greatest lower bound of elements, analogous to set intersection— is commonly denoted by ∧ in modern texts, though earlier works like Garrett Birkhoff's 1940 Lattice Theory used juxtaposition or product notation; this distinguishes it from the standard set-theoretic ∩ to avoid confusion with other algebraic products. This allows for generalized intersections in partially ordered sets without implying the full structure of power sets. In measure theory and probability, the intersection symbol ∩ remains standard for events A and B, with the joint probability denoted as P(A ∩ B), reflecting the measure of their overlap under a probability space; this usage aligns closely with set theory but adapts to sigma-algebras for countable intersections. Paul Halmos's 1950 Measure Theory uses ∩ for both finite and infinite cases to ensure compatibility with integration and expectation operators.^[34] In computer science, particularly in programming languages and data structures, set intersection is often implemented using operators like & for bitwise AND on integers representing sets or && for logical AND in conditional expressions, facilitating efficient computation in algorithms such as database queries or graph traversals. Donald Knuth's The Art of Computer Programming analyzes these in the context of bit vector intersections, where & optimizes space and time for large datasets.^[35] Rare variants appear in older geometric texts, where intersection of lines or figures was sometimes denoted by × or · to evoke crossing or multiplication of loci, predating the widespread adoption of ∩; additionally, some abstract algebra contexts avoid ∩ entirely to prevent overlap with ring multiplication symbols. These historical usages are documented in 19th-century works like those of Jakob Steiner on synthetic geometry, illustrating notational evolution toward standardization.

In Other Mathematical Contexts

In Topology

In topology, the intersection of subsets of a topological space inherits certain properties from the topology's axioms, particularly regarding openness and closedness. A topology on a set X is defined as a collection \mathcal{T} of subsets (open sets) such that the empty set and X are in \mathcal{T}, arbitrary unions of sets in \mathcal{T} are in \mathcal{T}, and finite intersections of sets in \mathcal{T} are in \mathcal{T}.^[36] Consequently, the intersection of finitely many open sets is open, but the intersection of arbitrarily many open sets need not be open.^[37] For example, in the standard topology on \mathbb{R}, the open intervals I_n = (-1/n, 1/n) for n \in \mathbb{N} have intersection \bigcap_{n=1}^\infty I_n = \{0\}, which is closed and not open.^[37] Closed sets, defined as complements of open sets, exhibit dual properties: the arbitrary intersection of closed sets is closed, while only finite unions of closed sets are closed.^[37] This follows from the De Morgan laws applied to the axioms for open sets. In metric topologies, such as the Euclidean topology, these properties specialize to familiar geometric cases, like the intersection of closed balls being closed.^[38] The interior of a set A, denoted \operatorname{int}(A), is the largest open set contained in A, and the closure \overline{A} is the smallest closed set containing A. For intersections, \operatorname{int}(A \cap B) = \operatorname{int}(A) \cap \operatorname{int}(B). This equality holds for finite intersections of sets.^[39] The boundary of a set A, or \partial A, consists of points in \overline{A} but not in \operatorname{int}(A), equivalently \partial A = \overline{A} \cap \overline{X \setminus A}.^[40] In disconnected spaces, such as the disjoint union of two open intervals in \mathbb{R}, the intersection of the component open sets is empty, illustrating how intersections can yield the empty open set.^[36] In differential topology, intersections of submanifolds are analyzed through transversality: two submanifolds M and N of a manifold X intersect transversally at p \in M \cap N if T_p M + T_p N = T_p X, where T_p denotes the tangent space at p.^[41] Under this condition, M \cap N is a submanifold of X with codimension equal to the sum of the codimensions of M and N in X.^[41] This framework extends qualitative topological properties to smooth structures, emphasizing local spanning of tangent spaces over metric distances.

In Probability and Statistics

In probability theory, the intersection of two events A and B in a probability space, denoted A \cap B, corresponds to the event consisting of outcomes where both A and B occur simultaneously. The probability measure P(A \cap B) assigns a value between 0 and 1 to this joint event, reflecting the likelihood of their co-occurrence under the axioms of probability as a countably additive set function on a sigma-algebra of events.^[42] This construction extends the set-theoretic intersection to a measurable framework, enabling rigorous quantification of dependencies between events.^[42] A fundamental concept involving event intersections is statistical independence. Two events A and B are independent if P(A \cap B) = P(A) P(B), meaning the probability of their joint occurrence equals the product of their marginal probabilities.^[43] This condition implies that knowledge of one event's occurrence provides no information about the other, a property that extends multiplicatively to collections of events under the product measure.^[43] Independence simplifies computations, such as in the law of total probability, where intersections partition the sample space.^[43] Conditional probability formalizes the probability of an event given another has occurred, defined as P(A \mid B) = \frac{P(A \cap B)}{P(B)} for P(B) > 0.^[43] This ratio isolates the intersection's contribution relative to the conditioning event, capturing dependence structures. Bayes' theorem builds directly on this by relating reverse conditionals: P(A \mid B) = \frac{P(B \mid A) P(A)}{P(B)}, where the intersections in the conditional terms link prior and posterior probabilities.^[44] The theorem, originally derived in the context of inverse probabilities, underpins Bayesian inference by updating beliefs via joint event likelihoods.^[44] For random variables, intersections underpin joint distributions. The joint cumulative distribution function of random variables X and Y is given by F_{X,Y}(x,y) = P(X \leq x, Y \leq y) = P(\{X \leq x\} \cap \{Y \leq y\}), which specifies probabilities over intersections of Borel events in the codomain.^[43] Marginal distributions arise by taking limits, such as F_X(x) = \lim_{y \to \infty} F_{X,Y}(x,y). Dependence between X and Y is quantified by covariance, \operatorname{Cov}(X,Y) = E[XY] - E[X]E[Y], where the expectation E[XY] integrates over the joint measure supported on event intersections; for indicator variables I_A and I_B, this reduces to \operatorname{Cov}(I_A, I_B) = P(A \cap B) - P(A)P(B), directly tying covariance to deviations from independence.^[43] Illustrative examples highlight these concepts. Consider two independent fair coin flips, where event A is heads on the first and B is heads on the second; then P(A \cap B) = \frac{1}{4} = P(A) P(B), demonstrating independence and multiplicative probability.^[43] In a real-world scenario, let A be "it rains on a given day" and B be "a person carries an umbrella"; if carrying depends on weather forecasts, P(A \cap B) > P(A) P(B), yielding positive covariance and illustrating conditional probability P(B \mid A) > P(B).^[43] For continuous random variables, joint densities over intersections align with measure-theoretic probability on topological spaces, though the focus remains on Lebesgue integration rather than purely topological properties.^[42]

References

[1]
Definition of intersection - Math Insight
The intersection of a set A with a B is the set of elements that are in both set A and B. The intersection is denoted as A∩B.
[2]
2.1.3.2.2 - Intersections | STAT 200
An intersection describes the overlap of two or more events, represented by ∩, and read as 'the probability of A and B'.
[3]
Unions and Intersections of Sets - Department of Mathematics at UTSA
Nov 16, 2021 · The union of two sets A and B is the set of elements which are in A, in B, or in both A and B. In symbols, A ∪ B = { x : x ∈ A or x ∈ B }
[4]
The algebra of sets - Wikipedia, the free encyclopedia - UMSL
Oct 5, 2004 · Like addition and multiplication, the operations of union and intersection are commutative and associative, and intersection distributes over ...
[5]
[PDF] § 6.2: Properties of Sets
Theorem 6.2.1: For all sets A, B, and C: Inclusion of Intersection: A ∩ B ⊆ A and A ∩ B ⊆ B. Inclusion in Union: A ⊆ A ∪ B and B ⊆ A ∪ B.
[6]
Properties of Set Operation
Basic properties of set operations are discussed here. 1 - 6 directly correspond to identities and implications of propositional logic, and 7 - 11 also follow ...
[7]
[PDF] Introduction to Set Theory
Aug 27, 2020 · The intersection of two sets A and B contains all of the objects that are in both sets. The intersection is denoted as C = A ∩ B, where the C = ...
[8]
Geometry Definitions and Facts - Florida State University
Definition of perpendicular lines: Perpendicular lines are lines that intersect and make adjacent angles congruent at their intersection.
[9]
https://resources.nu.edu/MathResources/geometry
[10]
[PDF] CMSC 754: Lecture 4 Line Segment Intersection
Geometric intersections: One of the most basic problems in computational geometry is that of computing intersections. It has numerous applications.Missing: definition | Show results with:definition
[11]
[PDF] Intersection Theory - Stacks Project
Intersection theory constructs the intersection product on Chow groups, using proper pushforward and flat pullback of cycles, and defines intersection ...
[12]
[PDF] Introduction to Discrete Mathematics
Sep 14, 2012 · Definition 1.5 (Intersection) The intersection of two (or more) sets is the set of all items in common to each set. If A and B are two sets ...
[13]
Intersection -- from Wolfram MathWorld
The intersection of two sets A and B is the set of elements common to A and B. This is written A intersection B, and is pronounced A intersection B or A cap B.Missing: definition | Show results with:definition
[14]
[PDF] Naive set theory. - Whitman People
Halmos —Naive Set Theory. John L. Kelley—Introduction to Modern Algebra. R ... follows immediately from the definition of intersections that if 1^0, then ...
[15]
Intersection - math word definition - Math Open Reference
An intersection is a single point where two lines meet or cross each other. In the figure above we would say that point K is the intersection of line segments ...
[16]
Transversal Intersection -- from Wolfram MathWorld
Intersection in homology only makes sense because an intersection can be made to be transversal. is positive or negative.
[17]
Circle-Circle Intersection -- from Wolfram MathWorld
The intersections of two circles determine a line known as the radical line. If three circles mutually intersect in a single point, their point of intersection ...Missing: dot product<|separator|>
[18]
Line-Line Intersection -- from Wolfram MathWorld
The intersection of two lines L_1 and L_2 in two dimensions with, L_1 containing the points (x_1,y_1) and (x_2,y_2), and L_2 containing the points (x_3,y_3) ...Missing: Euclidean | Show results with:Euclidean
[19]
[PDF] The Algebra of Lines
Apr 2, 2018 · • Standard Form: 𝐴𝑥 + 𝐵𝑦 = 𝐶. • Slope-Intercept Form: 𝑦 = 𝑚𝑥 ... In order to find the point of intersection of any 2 lines, we equate them to each ...<|separator|>
[20]
Plane-Plane Intersection -- from Wolfram MathWorld
Two planes always intersect in a line as long as they are not parallel. Let the planes be specified in Hessian normal form, then the line of intersection must ...Missing: 3D dot
[21]
Line-Plane Intersection -- from Wolfram MathWorld
The plane determined by the points x_1, x_2, and x_3 and the line passing through the points x_4 and x_5 intersect in a point which can be determined by ...Missing: 3D dot product
[22]
Bézout's Theorem -- from Wolfram MathWorld
Bézout's theorem for curves states that, in general, two algebraic curves of degrees m and n intersect in m·n points and cannot meet in more than m·n points.
[23]
[PDF] Bézout's Theorem for curves - UChicago Math
Aug 26, 2011 · The goal of this paper is to prove Bézout's Theorem for algebraic curves. Along the way, we introduce some basic notions in algebraic geometry.Missing: source | Show results with:source
[24]
Parallel -- from Wolfram MathWorld
Two lines in two-dimensional Euclidean space are said to be parallel if they do not intersect. In three-dimensional Euclidean space, parallel lines not only ...
[25]
Earliest Uses of Symbols of Set Theory and Logic - MacTutor
The symbols ∩ and ∪ were used by Giuseppe Peano (1858-1932) for intersection and union in 1888 in Calcolo geometrico secondo l'Ausdehnungslehre di H. Grassmann ...
[26]
[PDF] Chapter 4: Topological Spaces - UC Davis Math
Definition 4.1 A topology on a nonempty set X is a collection of subsets of X, called open sets, such that: (a) the empty set 0 and the set X are open;. (b) the ...
[27]
[PDF] Topology of the Real Numbers - UC Davis Math
An arbitrary intersection of closed sets is closed, and a finite union of closed sets is closed. Proof. If {Fi : i ∈ I} is an arbitrary collection of ...
[28]
[PDF] 3. Closed sets, closures, and density
An arbitrary intersection of closed sets is closed. Proof. The proofs of (1) ... To be more precise, one can “recover” all the open sets in a topology from the ...
[29]
Intersection and union of interiors - Math Counterexamples
Dec 17, 2016 · Consider a topological space E. For subsets A,B⊆E we have the equality A∘∩B∘=(A∩B)∘ and the inclusion A∘∪B∘⊆(A∪B)∘ where A∘ and B∘ denote the interior
[30]
boundary / frontier - PlanetMath
Mar 22, 2013 · From the definition, it follows that the boundary of any set is a closed set. It also follows that ∂A=∂(X\A) ⁡ ⁡ , and ∂X=∅=∂∅ ⁡ X = ∅ = ∂ ⁡ . ...<|control11|><|separator|>
[31]
https://mathworld.wolfram.com/Parallel.html
[32]
[PDF] Foundations of the theory of probability - Internet Archive
The theory of probability, as a mathematical discipline, can and should be developed from axioms in exactly the same way as Geometry and Algebra.
[33]
[PDF] Grinstead and Snell's Introduction to Probability
'Introduction to Probability, 2nd edition', published by the American Mathematical So- ciety, Copyright (C) 2003 Charles M. Grinstead and J. Laurie Snell. This ...
[34]
LII. An essay towards solving a problem in the doctrine of chances ...
This is an essay by Rev. Mr. Bayes, found among his papers, sent to John Canton, and published on 01 January 1763.