BROWSE ALPHABETICALLY LEVEL:    Elementary    Advanced    Both INCLUDE TOPICS:    Basic Math    Algebra    Analysis    Biography    Calculus    Comp Sci    Discrete    Economics    Foundations    Geometry    Graph Thry    History    Number Thry    Phys Sci    Statistics    Topology    Trigonometry constant function – filter constant function   A constant function f is one whose value is the same at all points of its domain. continuous   Analysis: A function f is continuous at a point x of its domain if, whenever we are given a number e greater than 0, we may find a d greater than 0 so that whenever y is within a d-neighborhood of x, then f(y) is within an e-neighborhood of f(x).Topology: A transformation of one topological space into another is continuous if the inverse image of every open set is open, or equivalently if the inverse image of every closed set is closed.Cf. uniformly continuous, equicontinuous, absolutely continuous. convergent sequence   See sequence. convergent series   See series. Related article: Series convex   Naively, a region of space is convex if the line segement joining any two points of the region lies wholly within it. Thus, a polygon is convex if every line segment joining any two points on its sides lies entirely within the polygon. (This is equivalent to the condition that all its interior angles be less than 180°.)More generally, a region in a real vector space is convex if whenever two points x and y are in the region then so is any point tx + (1 - t)y, where t lies in the interval [0, 1]. See the immediately following entries for additional uses of the descriptor “convex.”Cf. concave. convex function   A function is convex if the chord joining any two points of its graph lies entirely above the graph.Cf. concave function. countable   A set is countable if it is finite, or if it is infinite and bijective to the set of natural numbers (finite ordinals), i.e., if there exists a complete one-to-one mapping of the set in question onto the set N. Sets that are both countable and infinite are sometimes called denumerable. Georg Cantor proved that sets may be uncountably infinite, for example the set of real numbers. Related MiniText: Infinity -- You Can't Get There From Here... countably infinite   See countable cover   Topology: a collection of sets which contains a given set. If the sets in the covering collection are open sets, the cover is called an open cover.Partially ordered sets: If x and y are elements of a partially ordered set such that x y, and such that there is no z such that x z y, then we say that x covers y.Graph Theory: An edge or vertex of a graph is said to cover (verb) those vertices or edges, respectively, that it is incident on. A set of edges or vertices is said to cover any vertex or edge covered by any element of that set. A set of edges or vertices that covers all the vertices or edges, respectively, of the graph is called a cover (noun), usually with a specification of whether it consists of edges or vertices. See edge cover, vertex cover. dense   Given a space X and a subset A of X, we say that A is dense in X if the intersection of every open set of X with A is non-empty. E.g., the rational numbers are dense in the real numbers. denumerable   A set is denumerable if it is infinite and countable. derived set   Given a set X, the derived set of X is the set of accumulation points of X. The second derived set is the derived set of the derived set, and so on.Cf. Cantor-Bendixson Theorem. diameter   Geometry: A diameter of a circle (or sphere) is a line containing the center and with endpoints on the perimeter (resp. surface).Analysis: Given a set X in a metric space, the diameter of X is the supremum of the distances between all pairs of points of X.Graph Theory: The diameter of a given graph G is the maximum, over all pairs of vertices u, v of G that are in the same connected component of G, of the distance between u and v. In other words, it is the greatest distance between two vertices on the graph. discrete   General: So-called “Discrete Mathematics” consists of those branches of mathematics which are concerned with the relations among fixed rather than continuously varying quantities, e.g., combinatorics and probability.Topology: A topology on a set X is discrete if every subset of X is open, or equivalently if every one-point set of X is open. disk   A set of points consisting of a circle together with its interior points. The set consisting only of the interior points of a circle is called an open disk.Cf. neighborhood. epimorphism   A morphism f from X to Y is called an epimorphism when it is surjective, that is, when to each element y of Y there corresponds an x in X such that f(x) = y.Cf. monomorphism. equicontinuous   Let C[a,b] denote the space of all continuous functions on the real interval [a,b]. A subset S of C[0,1] is called equicontinuous at x in [a,b] if for any e greater than zero there is some d greater than zero such that for every function f in S we have: equipotent   Two sets are equipotent if there exists a function between them that is bijective, that is, which is “one-to-one” and “onto.”Cf. cardinal. Euclidean space   A space satisfying the axioms of Euclidean geometry. Specifically, a space in which the parallel postulate holds; equivalently, a space in which the distance between points is given by a straight line. extended real numbers   The set of real numbers together with a “point(s) at infinity.” If both a positive and a negative infinity are added, then the resulting space is order equivalent and topologically equivalent (i.e., homeomorphic) to the unit interval [0, 1]. If only a single point at infinity is added, the resulting space is topologically equivalent to the unit circle. filter   If X is a set (or class) and F is a family of subsets of X, then F is called a filter providedF is closed under intersections, i.e., for any sets A, B in F their intersection is also in F, andF is closed under supersets (upwardly closed), i.e., if A is any set in F and B is any set in X containing A, then B is in F. If X and F are as above, and if in addition for every subset Y of X either Y or its complement is in F, then F is called an ultrafilter (or maximal filter). Equivalently, an ultrafilter is a filter that is not the proper subset of any filter. A free ultrafilter is an ultrafilter which contains the complement of every finite set. If A is any subset of X, then the collection of supersets of A together with all finite intersections of supersets of A is called the filter generated by A. More generally, if U is any family of subsets of X that is closed unter finite intersections, then the family F of subsets which includes precisely U and all of the intersections of supersets of members of U is the filter generated by U, and U is called its filter base. If a filter F is generated by a singleton set, then it is called a principal filter. constant function – filter
 HOME | ABOUT | CONTACT | AD INFO | PRIVACYCopyright © 1997-2013, Math Academy Online™ / Platonic Realms™. Except where otherwise prohibited, material on this site may be printed for personal classroom use without permission by students and instructors for non-profit, educational purposes only. All other reproduction in whole or in part, including electronic reproduction or redistribution, for any purpose, except by express written agreement is strictly prohibited. Please send comments, corrections, and enquiries using our contact page.