Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Interval (mathematics)

From Wikipedia, the free encyclopedia
(Redirected fromOpen interval)
All numbers between two given numbers
This article is about intervals of real numbers and some generalizations. For intervals in order theory, seeInterval (order theory). For other uses, seeInterval (disambiguation).
The additionx +a on the number line. All numbers greater thanx and less thanx +a fall within that open interval.
Numeric intervals on the positive and negative sides of thenumber line.

Inmathematics, areal interval is theset of allreal numbers lying between two fixed endpoints with no "gaps". Each endpoint is either a real number or positive or negativeinfinity, indicating the interval extends without abound. A real interval can contain neither endpoint, either endpoint, or both endpoints, excluding any endpoint which is infinite.

For example, the set of real numbers consisting of0,1, and all numbers in between is an interval, denoted[0, 1] and called theunit interval; the set of allpositive real numbers is an interval, denoted(0, ∞); the set of all real numbers is an interval, denoted(−∞, ∞); and any single real numbera is an interval, denoted[a,a].

Intervals are ubiquitous inmathematical analysis. For example, they occur implicitly in theepsilon-delta definition of continuity; theintermediate value theorem asserts that the image of an interval by acontinuous function is an interval;integrals ofreal functions are defined over an interval; etc.

Interval arithmetic consists of computing with intervals instead of real numbers for providing a guaranteed enclosure of the result of a numerical computation, even in the presence of uncertainties ofinput data androunding errors.

Intervals are likewise defined on an arbitrarytotally ordered set, such asintegers orrational numbers. The notation of integer intervals is consideredin the special section below.

Unless explicitly otherwise specified, all intervals considered in this article are real intervals, that is, intervals of real numbers. Notable generalizations are summarized in a section below possibly with links to separate articles.

Definitions and terminology

[edit]

Definition of an interval

[edit]

Aninterval is asubset of thereal numbers that contains all real numbers lying between any two numbers of the subset. Examples are the numbersx{\displaystyle x} from one to two,1x2{\displaystyle 1\leq x\leq 2}, and the numbersy{\displaystyle y} greater than 10, i.e.y>10{\displaystyle y>10}. In particular, theempty set{\displaystyle \varnothing } and the entire set of real numbersR{\displaystyle \mathbb {R} } are both intervals.[1]

Theendpoints of an interval are itssupremum (least upper bound), and itsinfimum (greatest lower bound), if they exist as real numbers.[1] If the infimum does not exist and the interval is not empty, one says often that the corresponding endpoint is negative infinity, written.{\displaystyle -\infty .} Similarly, if the supremum of a non-empty interval does not exist, one says that the corresponding endpoint is positive infinity, written+.{\displaystyle +\infty .}

Non-empty intervals are completely determined by their endpoints and whether each endpoint belongs to the interval. This is a consequence of theleast-upper-bound property of the real numbers, which implies that if the elements of a non-empty interval are all less than some finite value, then the interval has a supremum. This characterization is used to specify intervals by means ofinterval notation, where a square or rounded bracket (parenthesis) indicates whether or not an endpoint belongs to the inteval.

Open and closed intervals

[edit]

Anopen interval does not include any endpoint and can be succinctly indicated with parentheses.[2] For example,(0,1)={x0<x<1}{\displaystyle (0,1)=\{x\mid 0<x<1\}} is the interval of all real numbers greater than0{\displaystyle 0} and less than1{\displaystyle 1}. (This interval can also be denoted by]0,1[{\displaystyle ]0,1[}, see below). The open interval(0,+){\displaystyle (0,+\infty )} consists of real numbers greater than0{\displaystyle 0}, i.e., positive real numbers. The open intervals have thus one of the forms

(a,b)={xRa<x<b},(,b)={xRx<b},(a,+)={xRa<x},(,+)=R,(a,a)=,{\displaystyle {\begin{aligned}(a,b)&=\{x\in \mathbb {R} \mid a<x<b\},\\(-\infty ,b)&=\{x\in \mathbb {R} \mid x<b\},\\(a,+\infty )&=\{x\in \mathbb {R} \mid a<x\},\\(-\infty ,+\infty )&=\mathbb {R} ,\\(a,a)&=\emptyset ,\end{aligned}}}

wherea{\displaystyle a} andb{\displaystyle b} are real numbers such thata<b.{\displaystyle a<b.} In the last case, the resulting interval is theempty set and does not depend ona{\displaystyle a}. The open intervals are those intervals that areopen sets for the usualtopology on the real numbers, and they form abase of the open sets.

Aclosed interval is an interval that includes all its finite endpoints. When both endpoints are finite, they are enclosed in square brackets.[2] For example,[0, 1] is the closed interval with contents greater than or equal to0 and less than or equal to1. Closed intervals, other than the empty interval, have one of the following forms in whicha andb are real numbers such thata<b:{\displaystyle a<b\colon }

[a,b]={xRaxb},(,b]={xRxb},[a,+)={xRax},(,+)=R,[a,a]={a}.{\displaystyle {\begin{aligned}\;[a,b]&=\{x\in \mathbb {R} \mid a\leq x\leq b\},\\\left(-\infty ,b\right]&=\{x\in \mathbb {R} \mid x\leq b\},\\\left[a,+\infty \right)&=\{x\in \mathbb {R} \mid a\leq x\},\\(-\infty ,+\infty )&=\mathbb {R} ,\\\left[a,a\right]&=\{a\}.\end{aligned}}}

The closed intervals are those intervals that areclosed sets for the usualtopology on the real numbers.

Half-open intervals

[edit]

Ahalf-open interval has two distinct finite endpoints, and includes one but not the other. It is said to beleft-open orright-open depending on whether the excluded endpoint is on the left or on the right. These intervals are denoted by mixing notations for open and closed intervals.[3] For example,(0, 1] means greater than0 and less than or equal to1, while[0, 1) means greater than or equal to0 and less than1. The half-open intervals have the form

(a,b]={xRa<xb},[a,b)={xRax<b}.{\displaystyle {\begin{aligned}\left(a,b\right]&=\{x\in \mathbb {R} \mid a<x\leq b\},\\\left[a,b\right)&=\{x\in \mathbb {R} \mid a\leq x<b\}.\\\end{aligned}}}

In summary, a set of the real numbers is an interval, if and only if it is an open interval, a closed interval, or a half-open interval. The only intervals that appear twice in the above classification are{\displaystyle \emptyset } andR{\displaystyle \mathbb {R} } that are both open and closed.[4][5]

Degenerate intervals

[edit]

Adegenerate interval is anyset consisting of a single real number (i.e., an interval of the form[a,a]).[6] Some authors include the empty set in this definition. A real interval that is neither empty nor degenerate is said to beproper, and has infinitely many elements.

Bounded intervals

[edit]

An interval is said to beleft-bounded orright-bounded, if there is some real number that is, respectively, smaller than or larger than all its elements. An interval is said to bebounded, if it is both left- and right-bounded; and is said to beunbounded otherwise. Intervals that are bounded at only one end are said to behalf-bounded. The empty set is bounded, and the set of all reals is the only interval that is unbounded at both ends. Bounded intervals are also commonly known asfinite intervals.

Bounded intervals arebounded sets, in the sense that theirdiameter (which is equal to theabsolute difference between the endpoints) is finite. The diameter may be called thelength,width,measure,range, orsize of the interval. The size of unbounded intervals is usually defined as+∞, and the size of the empty interval may be defined as0 (or left undefined).

Thecentre (midpoint) of a bounded interval with endpointsa andb is(a + b)/2, and itsradius is the half-length|a − b|/2. These concepts are undefined for empty or unbounded intervals.

Categorisation by minimum and maximum elements

[edit]

An interval is said to beleft-open if and only if it contains nominimum (an element that is smaller than all other elements);right-open if it contains nomaximum; andopen if it contains neither. The interval[0, 1) = {x | 0 ≤x < 1}, for example, is left-closed and right-open. The set of non-negative reals is a closed interval that is right-open but not left-open.

An interval is said to beleft-closed if it has a minimum element or is left-unbounded,right-closed if it has a maximum or is right unbounded; it is simplyclosed if it is both left-closed and right closed.

Sub-intervals and related constructions

[edit]

An intervalI is asubinterval of intervalJ ifI is asubset ofJ. An intervalI is aproper subinterval ofJ ifI is aproper subset ofJ.

Theinterior of an intervalI is the largest open interval that is contained inI; it is also the set of points inI which are not endpoints ofI. Theclosure ofI is the smallest closed interval that containsI; which is also the setI augmented with its finite endpoints.

For any setX of real numbers, theinterval enclosure orinterval span ofX is the unique interval that containsX, and does not properly contain any other interval that also containsX.

Segments and intervals

[edit]

There is conflicting terminology for the termssegment andinterval, which have been employed in the literature in two essentially opposite ways, resulting in ambiguity when these terms are used. TheEncyclopedia of Mathematics[7] definesinterval (without a qualifier) to exclude both endpoints (i.e., open interval) andsegment to include both endpoints (i.e., closed interval), while Rudin'sPrinciples of Mathematical Analysis[8] calls sets of the form [a,b]intervals and sets of the form (a,b)segments throughout. These terms tend to appear in older works; modern texts increasingly favor the terminterval (qualified byopen,closed, orhalf-open), regardless of whether endpoints are included.

Notations for intervals

[edit]

The interval of numbers betweena andb, includinga andb, is often denoted[a, b]. The two numbers are called theendpoints of the interval. In countries where numbers are written with adecimal comma, asemicolon may be used as a separator to avoid ambiguity.

Including or excluding endpoints

[edit]

To indicate that one of the endpoints is to be excluded from the set, the corresponding square bracket can be either replaced with a parenthesis, or reversed. Both notations are described inInternational standardISO 31-11. Thus, inset builder notation,

(a,b)=]a,b[={xRa<x<b},[a,b)=[a,b[={xRax<b},(a,b]=]a,b]={xRa<xb},[a,b]=[a,b]={xRaxb}.{\displaystyle {\begin{aligned}(a,b)={\mathopen {]}}a,b{\mathclose {[}}&=\{x\in \mathbb {R} \mid a<x<b\},\\[5mu][a,b)={\mathopen {[}}a,b{\mathclose {[}}&=\{x\in \mathbb {R} \mid a\leq x<b\},\\[5mu](a,b]={\mathopen {]}}a,b{\mathclose {]}}&=\{x\in \mathbb {R} \mid a<x\leq b\},\\[5mu][a,b]={\mathopen {[}}a,b{\mathclose {]}}&=\{x\in \mathbb {R} \mid a\leq x\leq b\}.\end{aligned}}}

Each interval(a, a),[a, a), and(a, a] represents theempty set, whereas[a, a] denotes the singleton set {a}. Whena >b, all four notations are usually taken to represent the empty set.

Both notations may overlap with other uses of parentheses and brackets in mathematics. For instance, the notation(a,b) is often used to denote anordered pair in set theory, thecoordinates of apoint orvector inanalytic geometry andlinear algebra, or (sometimes) acomplex number inalgebra. That is whyBourbaki introduced the notation]a,b[ to denote the open interval.[9] The notation[a,b] too is occasionally used for ordered pairs, especially incomputer science.

Some authors such as Yves Tillé use]a,b[ to denote the complement of the interval (a, b); namely, the set of all real numbers that are either less than or equal toa, or greater than or equal tob.

Infinite endpoints

[edit]

In some contexts, an interval may be defined as a subset of theextended real numbers, the set of all real numbers augmented with−∞ and+∞.

In this interpretation, the notations[−∞, b] ,(−∞, b] ,[a, +∞] , and[a, +∞) are all meaningful and distinct. In particular,(−∞, +∞) denotes the set of all ordinary real numbers, while[−∞, +∞] denotes the extended reals.

Even in the context of the ordinary reals, one may use aninfinite endpoint to indicate that there is no bound in that direction. For example,(0, +∞) is the set ofpositive real numbers, also written asR+.{\displaystyle \mathbb {R} _{+}.} The context affects some of the above definitions and terminology. For instance, the interval(−∞, +∞) = R{\displaystyle \mathbb {R} } is closed in the realm of ordinary reals, but not in the realm of the extended reals.

Integer intervals

[edit]

Whena andb areintegers, the notations ⟦a, b⟧,[a ..b],{a ..b}, or justa ..b, are sometimes used to indicate the interval of allintegers betweena andb included. The notation[a ..b] is used in someprogramming languages; inPascal, for example, it is used to formally define a subrange type, most frequently used to specify lower and upper bounds of validindices of anarray.

Another way to interpret integer intervals are assets defined by enumeration, usingellipsis notation.

An integer interval that has a finite lower or upper endpoint always includes that endpoint. Therefore, the exclusion of endpoints can be explicitly denoted by writinga ..b − 1 ,a + 1 ..b , ora + 1 ..b − 1. Alternate-bracket notations like[a ..b) or[a ..b[ are rarely used for integer intervals.[citation needed]

Properties

[edit]

The intervals are precisely theconnected subsets ofR.{\displaystyle \mathbb {R} .} It follows that the image of an interval by anycontinuous function fromR{\displaystyle \mathbb {R} } toR{\displaystyle \mathbb {R} } is also an interval. This is one formulation of theintermediate value theorem.

The intervals are also theconvex subsets ofR.{\displaystyle \mathbb {R} .} The interval enclosure of a subsetXR{\displaystyle X\subseteq \mathbb {R} } is also theconvex hull ofX.{\displaystyle X.}

Theclosure of an interval is the union of the interval and the set of its finite endpoints, and hence is also an interval. (The latter also follows from the fact that the closure of everyconnected subset of atopological space is a connected subset.) In other words, we have[10]

cl(a,b)=cl(a,b]=cl[a,b)=cl[a,b]=[a,b],{\displaystyle \operatorname {cl} (a,b)=\operatorname {cl} (a,b]=\operatorname {cl} [a,b)=\operatorname {cl} [a,b]=[a,b],}
cl(a,+)=cl[a,+)=[a,+),{\displaystyle \operatorname {cl} (a,+\infty )=\operatorname {cl} [a,+\infty )=[a,+\infty ),}
cl(,a)=cl(,a]=(,a],{\displaystyle \operatorname {cl} (-\infty ,a)=\operatorname {cl} (-\infty ,a]=(-\infty ,a],}
cl(,+)=(,).{\displaystyle \operatorname {cl} (-\infty ,+\infty )=(-\infty ,\infty ).}

The intersection of any collection of intervals is always an interval. The union of two intervals is an interval if and only if they have a non-empty intersection or an open end-point of one interval is a closed end-point of the other, for example(a,b)[b,c]=(a,c].{\displaystyle (a,b)\cup [b,c]=(a,c].}

IfR{\displaystyle \mathbb {R} } is viewed as ametric space, itsopen balls are the open bounded intervals (c + r, c − r), and itsclosed balls are the closed bounded intervals [c + r, c − r]. In particular, themetric andorder topologies in the real line coincide, which is the standard topology of the real line.

Any element x of an interval I defines a partition of I into three disjoint intervalsI1, I2, I3: respectively, the elements of I that are less than x, the singleton [x,x]={x},{\displaystyle [x,x]=\{x\},} and the elements that are greater than x. The partsI1 andI3 are both non-empty (and have non-empty interiors), if and only ifx is in the interior of I. This is an interval version of thetrichotomy principle.

Applications

[edit]

Dyadic intervals

[edit]

Adyadic interval is a bounded real interval whose endpoints arej2n{\displaystyle {\tfrac {j}{2^{n}}}} andj+12n,{\displaystyle {\tfrac {j+1}{2^{n}}},} wherej{\displaystyle j} andn{\displaystyle n} are integers. Depending on the context, either endpoint may or may not be included in the interval.

Dyadic intervals have the following properties:

  • The length of a dyadic interval is always an integerpower of two.
  • Each dyadic interval is contained in exactly one dyadic interval of twice the length.
  • Each dyadic interval is spanned by two dyadic intervals of half the length.
  • If two open dyadic intervals overlap, then one of them is a subset of the other.

The dyadic intervals consequently have a structure that reflects that of an infinitebinary tree.

Dyadic intervals are relevant to several areas ofnumerical analysis, includingadaptive mesh refinement,multigrid methods andwavelet analysis. Another way to represent such a structure isp-adic analysis (forp = 2).[11]

Real analysis

[edit]

Intervals are ubiquitous inmathematical analysis, where they are used to express ideas and often occur in key results.

Theintegral of areal function is defined over an interval. The endpoints of the interval involved usually occur as a subscript and superscript, so the integralabf(x)dx{\textstyle \int _{a}^{b}f(x)\,dx} applies to allx{\displaystyle x} belonging to the interval[a,b]{\displaystyle [a,b]}.

Intervals occur implicitly in theepsilon-delta definition of continuity of a functionf(x){\displaystyle f(x)}: the following account makes them explicit. The functionf{\displaystyle f} is said to be continuous at a pointa{\displaystyle a} if for any given valueε>0{\displaystyle \varepsilon >0} (epsilon greater than zero) there is a valueδ>0{\displaystyle \delta >0} (delta greater than zero) for whichf(x){\displaystyle f(x)} lies in the open interval(f(a)ε,f(a)+ε){\displaystyle \left(f(a)-\varepsilon ,f(a)+\varepsilon \right)} wheneverx{\displaystyle x} is chosen from the interval(aδ,a+δ){\displaystyle \left(a-\delta ,a+\delta \right)}. The possible values ofε{\displaystyle \varepsilon } andδ{\displaystyle \delta } themselves belong to the unbounded interval(0,+){\displaystyle (0,+\infty )}, but are usually considered to describe small positive increments. The idea is that a small symmetric interval around pointa{\displaystyle a} exists where the value off(x){\displaystyle f(x)} stays within an open interval of radiusε{\displaystyle \varepsilon } centred aroundf(a){\displaystyle f(a)}.

Theintermediate value theorem captures the intuition that iff:[a,b]R{\displaystyle f\colon [a,b]\to \mathbb {R} } is a real valuedcontinuous function on an interval[a,b]{\displaystyle [a,b]} andd{\displaystyle d} is any value betweenf(a){\displaystyle f(a)} andf(b){\displaystyle f(b)}, then we expect to find a valuec{\displaystyle c} betweena{\displaystyle a} andb{\displaystyle b} wheref(c)=d{\displaystyle f(c)=d}. For example, iff(x)=x2{\displaystyle f(x)=x^{2}} is defined on the interval[3,4]{\displaystyle [3,4]}, then givend=10{\displaystyle d=10} betweenf(3)=32=9{\displaystyle f(3)=3^{2}=9} andf(4)=42=16{\displaystyle f(4)=4^{2}=16}, there is a valuec{\displaystyle c} between3{\displaystyle 3} and4{\displaystyle 4} wheref(c)=c2=10{\displaystyle f(c)=c^{2}=10}.An equivalent formulation of the theorem asserts that theimage of an interval by a continuous function is an interval.

Confidence intervals

[edit]

Confidence intervals are important instatistical inference and provide a range of estimated values for an unknownstatistical parameter, such as a populationmean. Unlike other kinds of interval, a confidence interval is evaluated from arandom sample and the interval endpoints are real-valuedrandom variables. A different sample may well give a different result.

When sampling is repeated there is a pre-set probability, known as theconfidence level, that a corresponding interval contains the true value of the unknown parameter. For example, if the chosen confidence level were 0.95 and the same sampling procedure were repeated many times, in the long run approximately 95% of the resulting intervals would be expected to contain the true value.

Thenormal distribution provides a simplified illustration. It has aprobability density function whose graph is the familiar bell curve. The peak occurs at its meanμ{\displaystyle \mu } (the Greek letter mu) and its width can be described by its standard deviationσ{\displaystyle \sigma } (sigma). These two parameters distinguish one bell curve from another, but in all cases the region within two standard deviations either side of the mean represents a probability of approximately 0.95. This can be written

P(μ2σXμ+2σ)0.95{\displaystyle P(\mu -2\sigma \leq X\leq \mu +2\sigma )\approx 0.95}

for a normally distributed random variableX{\displaystyle X}.

TakeX¯{\displaystyle {\bar {X}}} to be thesample mean for a fixed sample size, which is anestimator forμ{\displaystyle \mu }. It also has a normal distribution with its own standard deviationσX¯{\displaystyle \sigma _{\bar {X}}}. The previous inequalities can then be written in terms ofμ{\displaystyle \mu } to give

P(X¯2σX¯μX¯+2σX¯)0.95.{\displaystyle P({\bar {X}}-2\sigma _{\bar {X}}\leq \mu \leq {\bar {X}}+2\sigma _{\bar {X}})\approx 0.95.}

If the value of the standard deviationσX¯{\displaystyle \sigma _{\bar {X}}} is known, then the interval[X¯2σX¯,X¯+2σX¯]{\displaystyle [{\bar {X}}-2\sigma _{\bar {X}},{\bar {X}}+2\sigma _{\bar {X}}]} will be a confidence interval forμ{\displaystyle \mu } with a confidence level of approximately 0.95. Its endpoints are the random variablesX¯2σX¯{\displaystyle {\bar {X}}-2\sigma _{\bar {X}}} andX¯+2σX¯{\displaystyle {\bar {X}}+2\sigma _{\bar {X}}}, whose actual values will depend on the sample taken.

In general topology

[edit]

EveryTychonoff space is embeddable into aproduct space of the closed unit intervals[0,1].{\displaystyle [0,1].} Actually, every Tychonoff space that has abase ofcardinalityκ{\displaystyle \kappa } is embeddable into the product[0,1]κ{\displaystyle [0,1]^{\kappa }} ofκ{\displaystyle \kappa } copies of the intervals.[12]: p. 83, Theorem 2.3.23 

The concepts of convex sets and convex components are used in a proof that everytotally ordered set endowed with theorder topology iscompletely normal[13] or moreover,monotonically normal.[14]

Generalizations

[edit]

Balls

[edit]

An open finite interval(a,b){\displaystyle (a,b)} is a 1-dimensional openball with acenter at12(a+b){\displaystyle {\tfrac {1}{2}}(a+b)} and aradius of12(ba).{\displaystyle {\tfrac {1}{2}}(b-a).} The closed finite interval[a,b]{\displaystyle [a,b]} is the corresponding closed ball, and the interval's two endpoints{a,b}{\displaystyle \{a,b\}} form a 0-dimensionalsphere. Generalized ton{\displaystyle n}-dimensionalEuclidean space, a ball is the set of points whose distance from the center is less than the radius. In the 2-dimensional case, a ball is called adisk.

If ahalf-space is taken as a kind ofdegenerate ball (without a well-defined center or radius), a half-space can be taken as analogous to a half-bounded interval, with its boundary plane as the (degenerate) sphere corresponding to the finite endpoint.

Multi-dimensional intervals

[edit]

A finite interval is (the interior of) a 1-dimensionalhyperrectangle. Generalized toreal coordinate spaceRn,{\displaystyle \mathbb {R} ^{n},} anaxis-aligned hyperrectangle (or box) is theCartesian product ofn{\displaystyle n} finite intervals. Forn=2{\displaystyle n=2} this is arectangle; forn=3{\displaystyle n=3} this is arectangular cuboid (also called a "box").

Allowing for a mix of open, closed, and infinite endpoints, the Cartesian product of anyn{\displaystyle n} intervals,I=I1×I2××In{\displaystyle I=I_{1}\times I_{2}\times \cdots \times I_{n}} is sometimes called ann{\displaystyle n}-dimensional interval.[citation needed]

Afacet of such an intervalI{\displaystyle I} is the result of replacing any non-degenerate interval factorIk{\displaystyle I_{k}} by a degenerate interval consisting of a finite endpoint ofIk.{\displaystyle I_{k}.} Thefaces ofI{\displaystyle I} compriseI{\displaystyle I} itself and all faces of its facets. Thecorners ofI{\displaystyle I} are the faces that consist of a single point ofRn.{\displaystyle \mathbb {R} ^{n}.}[citation needed]

Convex polytopes

[edit]

Any finite interval can be constructed as theintersection of half-bounded intervals (with an empty intersection taken to mean the whole real line), and the intersection of any number of half-bounded intervals is a (possibly empty) interval. Generalized ton{\displaystyle n}-dimensionalaffine space, an intersection of half-spaces (of arbitrary orientation) is (the interior of) aconvex polytope, or in the 2-dimensional case aconvex polygon.

Domains

[edit]

An open interval is a connected open set of real numbers. Generalized totopological spaces in general, a non-empty connected open set is called adomain.

Complex intervals

[edit]

Intervals ofcomplex numbers can be defined as regions of thecomplex plane, eitherrectangular orcircular.[15]

Intervals in posets and preordered sets

[edit]
Main article:interval (order theory)

Definitions

[edit]

The concept of intervals can be defined in arbitrarypartially ordered sets or more generally, in arbitrarypreordered sets. For apreordered set(X,){\displaystyle (X,\lesssim )} and two elementsa,bX,{\displaystyle a,b\in X,} one similarly defines the intervals[16]: 11, Definition 11 

(a,b)={xXa<x<b},{\displaystyle (a,b)=\{x\in X\mid a<x<b\},}
[a,b]={xXaxb},{\displaystyle [a,b]=\{x\in X\mid a\lesssim x\lesssim b\},}
(a,b]={xXa<xb},{\displaystyle (a,b]=\{x\in X\mid a<x\lesssim b\},}
[a,b)={xXax<b},{\displaystyle [a,b)=\{x\in X\mid a\lesssim x<b\},}
(a,)={xXa<x},{\displaystyle (a,\infty )=\{x\in X\mid a<x\},}
[a,)={xXax},{\displaystyle [a,\infty )=\{x\in X\mid a\lesssim x\},}
(,b)={xXx<b},{\displaystyle (-\infty ,b)=\{x\in X\mid x<b\},}
(,b]={xXxb},{\displaystyle (-\infty ,b]=\{x\in X\mid x\lesssim b\},}
(,)=X,{\displaystyle (-\infty ,\infty )=X,}

wherex<y{\displaystyle x<y} meansxyx.{\displaystyle x\lesssim y\not \lesssim x.} Actually, the intervals with single or no endpoints are the same as the intervals with two endpoints in the larger preordered set

X¯=X{,}{\displaystyle {\bar {X}}=X\sqcup \{-\infty ,\infty \}}
<x<(xX){\displaystyle -\infty <x<\infty \qquad (\forall x\in X)}

defined by adding new smallest and greatest elements (even if there were ones), which are subsets ofX.{\displaystyle X.} In the case ofX=R{\displaystyle X=\mathbb {R} } one may takeR¯{\displaystyle {\bar {\mathbb {R} }}} to be theextended real line.

Convex sets and convex components in order theory

[edit]
Main article:convex set (order theory)

A subsetAX{\displaystyle A\subseteq X} of thepreordered set(X,){\displaystyle (X,\lesssim )} is(order-)convex if for everyx,yA{\displaystyle x,y\in A} and everyxzy{\displaystyle x\lesssim z\lesssim y} we havezA.{\displaystyle z\in A.} Unlike in the case of the real line, a convex set of a preordered set need not be an interval. For example, in thetotally ordered set(Q,){\displaystyle (\mathbb {Q} ,\leq )} ofrational numbers, the set

Q={xQx2<2}{\displaystyle \mathbb {Q} =\{x\in \mathbb {Q} \mid x^{2}<2\}}

is convex, but not an interval ofQ,{\displaystyle \mathbb {Q} ,} since there is no square root of two inQ.{\displaystyle \mathbb {Q} .}

Let(X,){\displaystyle (X,\lesssim )} be apreordered set and letYX.{\displaystyle Y\subseteq X.} The convex sets ofX{\displaystyle X} contained inY{\displaystyle Y} form aposet under inclusion. Amaximal element of this poset is called aconvex component ofY.{\displaystyle Y.}[14]: Definition 5.1 [13]: 727  By theZorn lemma, any convex set ofX{\displaystyle X} contained inY{\displaystyle Y} is contained in some convex component ofY,{\displaystyle Y,} but such components need not be unique. In atotally ordered set, such a component is always unique. That is, the convex components of a subset of a totally ordered set form apartition.

Properties

[edit]

A generalization of the characterizations of the real intervals follows. For a non-empty subsetI{\displaystyle I} of alinear continuum(L,),{\displaystyle (L,\leq ),} the following conditions are equivalent.[17]: 153, Theorem 24.1 

For asubsetS{\displaystyle S} of alatticeL,{\displaystyle L,} the following conditions are equivalent.

Topological algebra

[edit]
icon
This sectionneeds additional citations forverification. Please helpimprove this article byadding citations to reliable sources in this section. Unsourced material may be challenged and removed.
Find sources: "Interval" mathematics – news ·newspapers ·books ·scholar ·JSTOR
(September 2023) (Learn how and when to remove this message)

Intervals can be associated with points of the plane, and hence regions of intervals can be associated withregions of the plane. Generally, an interval in mathematics corresponds to an ordered pair(x,y) taken from thedirect productR×R{\displaystyle \mathbb {R} \times \mathbb {R} } of real numbers with itself, where it is often assumed thaty >x. For purposes ofmathematical structure, this restriction is discarded,[18] and "reversed intervals" whereyx < 0 are allowed. Then, the collection of all intervals[x,y] can be identified with thetopological ring formed by thedirect sum ofR{\displaystyle \mathbb {R} } with itself, where addition and multiplication are defined component-wise.

The direct sum algebra(RR,+,×){\displaystyle (\mathbb {R} \oplus \mathbb {R} ,+,\times )} has twoideals, { [x,0] :x ∈ R } and { [0,y] :y ∈ R }. Theidentity element of this algebra is the condensed interval[1, 1]. If interval[x,y] is not in one of the ideals, then it hasmultiplicative inverse[1/x, 1/y]. Endowed with the usualtopology, the algebra of intervals forms atopological ring. Thegroup of units of this ring consists of fourquadrants determined by the axes, or ideals in this case. Theidentity component of this group is quadrant I.

Every interval can be considered a symmetric interval around itsmidpoint. In a reconfiguration published in 1956 by M Warmus, the axis of "balanced intervals"[x, −x] is used along with the axis of intervals[x,x] that reduce to a point. Instead of the direct sumRR,{\displaystyle R\oplus R,} the ring of intervals has been identified[19] with thehyperbolic numbers by M. Warmus andD. H. Lehmer through the identification

z=12(x+y)+12(xy)j,{\displaystyle z={\tfrac {1}{2}}(x+y)+{\tfrac {1}{2}}(x-y)j,}

wherej2=1.{\displaystyle j^{2}=1.}

This linear mapping of the plane, which amounts of aring isomorphism, provides the plane with a multiplicative structure having some analogies to ordinary complex arithmetic, such aspolar decomposition.

See also

[edit]

References

[edit]
  1. ^abBertsekas, Dimitri P. (1998).Network Optimization: Continuous and Discrete Methods. Athena Scientific. p. 409.ISBN 1-886529-02-7.
  2. ^abStrichartz, Robert S. (2000).The Way of Analysis. Jones & Bartlett Publishers. p. 86.ISBN 0-7637-1497-6.
  3. ^Weisstein, Eric W."Interval".mathworld.wolfram.com. Retrieved2020-08-23.
  4. ^"Interval and segment",Encyclopedia of Mathematics,EMS Press, 2001 [1994]
  5. ^Tao, Terence (2016).Analysis I. Texts and Readings in Mathematics. Vol. 37 (3 ed.). Singapore: Springer. p. 212.doi:10.1007/978-981-10-1789-6.ISBN 978-981-10-1789-6.ISSN 2366-8725.LCCN 2016940817. See Definition 9.1.1.
  6. ^Cramér, Harald (1999).Mathematical Methods of Statistics. Princeton University Press. p. 11.ISBN 0691005478.
  7. ^"Interval and segment - Encyclopedia of Mathematics".encyclopediaofmath.org.Archived from the original on 2014-12-26. Retrieved2016-11-12.
  8. ^Rudin, Walter (1976).Principles of Mathematical Analysis. New York: McGraw-Hill. pp. 31.ISBN 0-07-054235-X.
  9. ^"Why is American and French notation different for open intervals (x,y) vs. ]x,y[?".hsm.stackexchange.com. Retrieved28 April 2018.
  10. ^Tao (2016), p. 214, See Lemma 9.1.12.
  11. ^Kozyrev, Sergey (2002)."Wavelet theory asp-adic spectral analysis".Izvestiya RAN. Ser. Mat.66 (2):149–158.arXiv:math-ph/0012019.Bibcode:2002IzMat..66..367K.doi:10.1070/IM2002v066n02ABEH000381.S2CID 16796699. Retrieved2012-04-05.
  12. ^Engelking, Ryszard (1989).General topology. Sigma Series in Pure Mathematics. Vol. 6 (Revised and completed ed.). Berlin: Heldermann Verlag.ISBN 3-88538-006-4.MR 1039321.Zbl 0684.54001.
  13. ^abSteen, Lynn A. (1970)."A direct proof that a linearly ordered space is hereditarily collection-wise normal".Proceedings of the American Mathematical Society.24 (4):727–728.doi:10.2307/2037311.ISSN 0002-9939.JSTOR 2037311.MR 0257985.Zbl 0189.53103.
  14. ^abHeath, R. W.; Lutzer, David J.; Zenor, P. L. (1973)."Monotonically normal spaces".Transactions of the American Mathematical Society.178:481–493.doi:10.2307/1996713.ISSN 0002-9947.JSTOR 1996713.MR 0372826.Zbl 0269.54009.
  15. ^Complex interval arithmetic and its applications, Miodrag Petković, Ljiljana Petković, Wiley-VCH, 1998,ISBN 978-3-527-40134-5
  16. ^Vind, Karl (2003).Independence, additivity, uncertainty. Studies in Economic Theory. Vol. 14. Berlin: Springer.doi:10.1007/978-3-540-24757-9.ISBN 978-3-540-41683-8.Zbl 1080.91001.
  17. ^Munkres, James R. (2000).Topology (2 ed.). Prentice Hall.ISBN 978-0-13-181629-9.MR 0464128.Zbl 0951.54001.
  18. ^Kaj Madsen (1979), Review of "Interval analysis in the extended interval space" by Edgar Kaucher,MR 0586220
  19. ^D. H. Lehmer (1956) Review of "Calculus of Approximations",MR 0081372

Bibliography

[edit]

External links

[edit]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Interval_(mathematics)&oldid=1337612155#open_interval"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2026 Movatter.jp