Regions of the Complex Plane
This overlaps with the definitions in Metric Spaces - I need to combine these!
An -neighborhood of a point is the set of all complex numbers satisfying
This is the set of all complex numbers interior to a circle of radius and center , but not including the circumference of the circle.
A point of a set of complex numbers is called an interior point of if there exists an -neighborhood of that contains only points of .
On the other hand, is a boundary point of if every -neighborhood of contains at least one point of and at least one point not in . The set of all boundary points of a set is called the boundary of .
A set of complex numbers is said to be open if all points in are interior points. Alternatively, a set is open if it contains none of its boundary points.
A set of complex numbers is said to be closed if it contains all of its boundary points.
Note that a set can be both open and closed! Both the empty set and are both open and closed.
A set of complex numbers is said to be bounded if there exists a positive (real) number such that for all in . This means that a set is bounded if all its points fit within a circle of finite radius. A set that is not bounded is said to be unbounded.
A set is said to be connected if every pair of points in can be joined by a finite number of line segments joined end to end that lie entirely within .
Referenced by (1 direct)
Direct references:
- Connected Sets (embedded)
A domain is an open connected set. Note that this is not the same as a domain of definition of a function.
Referenced by (23 direct, 139 transitive)
Direct references:
- Path Independent
- remark-12
- closed-path-of-path-independent-integral-is-zero
- theorem-19
- Green's Theorem
- Volume Integral
- Divergence Theorem of Gauss
- Stoke's Theorem
- Derivatives of Complex Functions
- Harmonic Functions
- Elementary Functions
- Contour Integral
- Indepenence of Path of Contour Integrals
- Cauchy-Goursat Theorem
- Cauchy's Integral Theorem
- Cauchy Integral Theorem
- Taylor Expansion Theorem
- Residue Integration
- Outer Measure
- Separation of Variables
- Well-posedness of IVPs
- Random Variable
- Parameter Space
Transitive (depth 1):
- proof-of-cauchys-integral-theorem
- proof-of-integral-of-one-over-z-around-unit-circle
- Parametric Family
- fundamental-theorem-of-line-integrals
- remark-10
- remark-11
- theorem-7-intuition
- A/B Test
- Absolutely Continuous Random Variable
- Binomial Distribution
- Central Limit Theorem
- chebyshev-fish
- Chebyshev's Inequality
- chebyshevs-inequality-note
- Conditional Entropy
- Conditional Independence Given Intermediate Step
- Conditional Mutual Information
- Convolution
- corollary-88
- Covariance
- Cumulative Distribution Function
- Discrete Random Variable
- Entropy
- Expected Value
- Function of middle variable forms Markov Chain
- Identically Distributed
- Independent and Identically Distributed
- Jensen's Inequality
- Joint Entropy
- joint-entropy-is-less-than-or-equal-to-entropy-of-parts
- Joint Probability Distribution
- Law of Large Numbers
- law-of-large-numbers-note
- Markov Chain
- markov-inequality-fish
- Markov's Inequality
- Continuity Theorem for Moment Generating Functions
- Moment Generating Function of a Sum
- Moment Generating Function
- Mutual Independence
- Mutual Information
- Negative Binomial Distribution
- Nonnegativity of Mutual Information
- Normal Approximation to the Binomial
- Normal Distribution
- Pairwise Independence
- Poisson Approximation to the Binomial
- Poisson Distribution
- Probability Distribution
- proof-of-chebyshevs-inequality
- proof-of-fanos-inequality
- proof-of-law-of-large-numbers
- remark-14
- Reversibility of Markov Chains
- Self-Information
- Standard Normal Distribution
- State Space
- Sum of Independent Normal Random Variables
- Sum of Independent Poisson Random Variables
- theorem-16
- theorem-7
- Uniform Distribution
- Uniform distribution maximizes entropy
- Variance
Transitive (depth 2):
- Probability Density Function
- Hypergeometric Distribution
- note-25
- proof-of-chain-rule-for-mutual-information
- Geometric Distribution
- Probability of Error
- Conditioning Reduces Entropy
- Cross-Entropy
- doubly-stochastic-maps-increase-entropy-intuition
- Entropy Rate
- fanos-inequality-remark
- Gibbs' Inequality
- Chain rule for joint entropy
- KL Divergence
- lemma-93
- Noiseless channel transmitting discrete symbols
- note-8
- proof-of-concavity-of-entropy
- proof-of-doubly-stochastic-maps-increase-entropy
- proof-of-joint-entropy-is-less-than-or-equal-to-entropy-of-parts
- proof-of-uniform-distribution-maximizes-entropy
- theorem-12
- Weak Asymptotic Equipartition Property
- Interpretation
- markovs-inequality-note
- proof-of-markovs-inequality
- proof-of-weak-asymptotic-equipartition-property
- proof-of-processing-cannot-increase-information
- proof-of-corollary-95
- proof-of-gibbs-inequality
- proof-of-lemma-93
- proof-of-log-sum-inequality
- proof-of-conditioning-reduces-entropy
- Conditional Relative Entropy
- Conditionally Independent
- proof-of-concavity-and-convexity-of-mutual-information
- Ergodic
- note-19
- proof-of-characterization-of-sufficiency
- proof-of-data-processing-inequality
- Stationary Distribution of an Ergodic Chain
- Strong Asymptotic Equipartition Property (Shannon--McMillan--Breiman)
- Sufficient Statistic
- Concavity and Convexity of Mutual Information
- proof-of-nonnegativity-of-mutual-information
- Bias
- Characterization of Sufficiency
- Conditional Probability Distribution
- Convexity of Relative Entropy
- Product Distribution
- proof-of-convexity-of-relative-entropy
- proof-of-nonnegativity-of-relative-entropy
- note-15
- remark-8
- note-3
- concavity-of-entropy-intuition
- Confidence Interval for a Mean, Known Variance
- Confidence Interval for a Mean, Unknown Variance
- Standard Deviation
- variance-interpretation
Transitive (depth 3):
- proof-of-joint-is-marginal-times-conditional
- proof-of-chain-rule-for-relative-entropy
- proof-of-nonnegativity-of-conditional-relative-entropy
- Nonnegativity of Conditional Mutual Information
- proof-of-conditional-independence-given-intermediate-step
- proof-of-nonnegativity-of-conditional-mutual-information
- Model Training
- proof-of-chain-rule-for-entropy
- proof-of-mutual-information-and-entropy
- convexity-of-relative-entropy-intuition
- remark-32
- Multiplication Rule for Distributions
- proof-of-corollary-77
- characterization-of-sufficiency-example
- Minimal Sufficient Statistic
In the images below, a dashed line represents a boundary that is not included the in the set, while a solid line represents a boundary that is included in the set.
Squiggly blue highlighter indicates the set goes on forever and the party never ends!
