Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Epigraph (mathematics)

From Wikipedia, the free encyclopedia
Region above a graph
Not to be confused with epigraph as an inscription studied in the archeological sub-discipline of epigraphy, orepigraph (literature).
Epigraph of a function
A function (in black) is convex if and only if the region above its graph (in green) is aconvex set. This region is the function's epigraph.

Inmathematics, theepigraph orsupergraph[1] of afunctionf:X[,]{\displaystyle f:X\to [-\infty ,\infty ]} valued in theextended real numbers[,]=R{±}{\displaystyle [-\infty ,\infty ]=\mathbb {R} \cup \{\pm \infty \}} is thesetepif={(x,r)X×R : rf(x)}{\displaystyle \operatorname {epi} f=\{(x,r)\in X\times \mathbb {R} ~:~r\geq f(x)\}}consisting of all points in theCartesian productX×R{\displaystyle X\times \mathbb {R} } lying on or above the function'sgraph.[2] Similarly, thestrict epigraphepiSf{\displaystyle \operatorname {epi} _{S}f} is the set of points inX×R{\displaystyle X\times \mathbb {R} } lying strictly above its graph.

Importantly, unlike the graph off,{\displaystyle f,} the epigraphalways consistsentirely of points inX×R{\displaystyle X\times \mathbb {R} } (this is true of the graph only whenf{\displaystyle f} is real-valued). If the function takes±{\displaystyle \pm \infty } as a value thengraphf{\displaystyle \operatorname {graph} f} willnot be a subset of its epigraphepif.{\displaystyle \operatorname {epi} f.} For example, iff(x0)={\displaystyle f\left(x_{0}\right)=\infty } then the point(x0,f(x0))=(x0,){\displaystyle \left(x_{0},f\left(x_{0}\right)\right)=\left(x_{0},\infty \right)} will belong tographf{\displaystyle \operatorname {graph} f} but not toepif.{\displaystyle \operatorname {epi} f.} These two sets are nevertheless closely related because the graph can always be reconstructed from the epigraph, and vice versa.

The study ofcontinuousreal-valued functions inreal analysis has traditionally been closely associated with the study of theirgraphs, which are sets that provide geometric information (and intuition) about these functions.[2] Epigraphs serve this same purpose in the fields ofconvex analysis andvariational analysis, in which the primary focus is onconvex functions valued in[,]{\displaystyle [-\infty ,\infty ]} instead of continuous functions valued in a vector space (such asR{\displaystyle \mathbb {R} } orR2{\displaystyle \mathbb {R} ^{2}}).[2] This is because in general, for such functions, geometric intuition is more readily obtained from a function's epigraph than from its graph.[2] Similarly to how graphs are used in real analysis, the epigraph can often be used to give geometrical interpretations of aconvex function's properties, to help formulate or prove hypotheses, or to aid in constructingcounterexamples.

Definition

[edit]

The definition of the epigraph was inspired by that of thegraph of a function, where thegraph off:XY{\displaystyle f:X\to Y} is defined to be the setgraphf:={(x,y)X×Y : y=f(x)}.{\displaystyle \operatorname {graph} f:=\{(x,y)\in X\times Y~:~y=f(x)\}.}

Theepigraph orsupergraph of a functionf:X[,]{\displaystyle f:X\to [-\infty ,\infty ]} valued in theextended real numbers[,]=R{±}{\displaystyle [-\infty ,\infty ]=\mathbb {R} \cup \{\pm \infty \}} is the set[2]epif={(x,r)X×R : rf(x)}=[f1()×R]xf1(R)({x}×[f(x),)){\displaystyle {\begin{alignedat}{4}\operatorname {epi} f&=\{(x,r)\in X\times \mathbb {R} ~:~r\geq f(x)\}\\&=\left[f^{-1}(-\infty )\times \mathbb {R} \right]\cup \bigcup _{x\in f^{-1}(\mathbb {R} )}(\{x\}\times [f(x),\infty ))\end{alignedat}}}where all sets being unioned in the last line are pairwise disjoint.

In the union overxf1(R){\displaystyle x\in f^{-1}(\mathbb {R} )} that appears above on the right hand side of the last line, the set{x}×[f(x),){\displaystyle \{x\}\times [f(x),\infty )} may be interpreted as being a "vertical ray" consisting of(x,f(x)){\displaystyle (x,f(x))} and all points inX×R{\displaystyle X\times \mathbb {R} } "directly above" it. Similarly, the set of points on or below the graph of a function is itshypograph.

Thestrict epigraph is the epigraph with the graph removed:epiSf={(x,r)X×R : r>f(x)}=epifgraphf=xX({x}×(f(x),)){\displaystyle {\begin{alignedat}{4}\operatorname {epi} _{S}f&=\{(x,r)\in X\times \mathbb {R} ~:~r>f(x)\}\\&=\operatorname {epi} f\setminus \operatorname {graph} f\\&=\bigcup _{x\in X}\left(\{x\}\times (f(x),\infty )\right)\end{alignedat}}}where all sets being unioned in the last line are pairwise disjoint, and some may be empty.

Relationships with other sets

[edit]

Despite the fact thatf{\displaystyle f} might take one (or both) of±{\displaystyle \pm \infty } as a value (in which case its graph wouldnot be a subset ofX×R{\displaystyle X\times \mathbb {R} }), the epigraph off{\displaystyle f} is nevertheless defined to be a subset ofX×R{\displaystyle X\times \mathbb {R} } rather than ofX×[,].{\displaystyle X\times [-\infty ,\infty ].} This is intentional because whenX{\displaystyle X} is avector space then so isX×R{\displaystyle X\times \mathbb {R} } butX×[,]{\displaystyle X\times [-\infty ,\infty ]} isnever a vector space[2] (since theextended real number line[,]{\displaystyle [-\infty ,\infty ]} is not a vector space). This deficiency inX×[,]{\displaystyle X\times [-\infty ,\infty ]} remains even if instead of being a vector space,X{\displaystyle X} is merely a non-empty subset of some vector space. The epigraph being a subset of a vector space allows for tools related toreal analysis andfunctional analysis (and other fields) to be more readily applied.

Thedomain (rather than thecodomain) of the function is not particularly important for this definition; it can be anylinear space[1] or even an arbitrary set[3] instead ofRn{\displaystyle \mathbb {R} ^{n}}.

The strict epigraphepiSf{\displaystyle \operatorname {epi} _{S}f} and the graphgraphf{\displaystyle \operatorname {graph} f} are always disjoint.

The epigraph of a functionf:X[,]{\displaystyle f:X\to [-\infty ,\infty ]} is related to its graph and strict epigraph byepifepiSfgraphf{\displaystyle \,\operatorname {epi} f\,\subseteq \,\operatorname {epi} _{S}f\,\cup \,\operatorname {graph} f}where set equality holds if and only iff{\displaystyle f} is real-valued. However,epif=[epiSfgraphf][X×R]{\displaystyle \operatorname {epi} f=\left[\operatorname {epi} _{S}f\,\cup \,\operatorname {graph} f\right]\,\cap \,[X\times \mathbb {R} ]} always holds.

Reconstructing functions from epigraphs

[edit]

The epigraph isempty if and only if the function is identically equal to infinity.

Just as any function can be reconstructed from its graph, so too can any extended real-valued functionf{\displaystyle f} onX{\displaystyle X} be reconstructed from its epigraphE:=epif{\displaystyle E:=\operatorname {epi} f} (even whenf{\displaystyle f} takes on±{\displaystyle \pm \infty } as a value). GivenxX,{\displaystyle x\in X,} the valuef(x){\displaystyle f(x)} can be reconstructed from the intersectionE({x}×R){\displaystyle E\cap (\{x\}\times \mathbb {R} )} ofE{\displaystyle E} with the "vertical line"{x}×R{\displaystyle \{x\}\times \mathbb {R} } passing throughx{\displaystyle x} as follows:

The above observations can be combined to give a single formula forf(x){\displaystyle f(x)} in terms ofE:=epif.{\displaystyle E:=\operatorname {epi} f.} Specifically, for anyxX,{\displaystyle x\in X,}f(x)=inf{rR : (x,r)E}{\displaystyle f(x)=\inf _{}\{r\in \mathbb {R} ~:~(x,r)\in E\}}where by definition,inf:=.{\displaystyle \inf _{}\varnothing :=\infty .} This same formula can also be used to reconstructf{\displaystyle f} from its strict epigraphE:=epiSf.{\displaystyle E:=\operatorname {epi} _{S}f.}

Relationships between properties of functions and their epigraphs

[edit]

A function isconvex if and only if its epigraph is aconvex set. The epigraph of a realaffine functiong:RnR{\displaystyle g:\mathbb {R} ^{n}\to \mathbb {R} } is ahalfspace inRn+1.{\displaystyle \mathbb {R} ^{n+1}.}

A function islower semicontinuous if and only if its epigraph isclosed.

See also

[edit]

Citations

[edit]
Wikimedia Commons has media related toepigraphs und hypographs.
  1. ^abPekka Neittaanmäki; Sergey R. Repin (2004).Reliable Methods for Computer Simulation: Error Control and Posteriori Estimates. Elsevier. p. 81.ISBN 978-0-08-054050-4.
  2. ^abcdefRockafellar & Wets 2009, pp. 1–37.
  3. ^Charalambos D. Aliprantis;Kim C. Border (2007).Infinite Dimensional Analysis: A Hitchhiker's Guide (3rd ed.). Springer Science & Business Media. p. 8.ISBN 978-3-540-32696-0.

References

[edit]
Basic concepts
Topics (list)
Maps
Mainresults (list)
Sets
Series
Duality
Applications and related
Retrieved from "https://en.wikipedia.org/w/index.php?title=Epigraph_(mathematics)&oldid=1235984639"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp