Publication
Non-autonomous functionals, borderline cases and related function classes
Related concepts (34)
Provence
Provence (prəˈvɒ̃s, USalsoprəʊˈ-, UKalsoprɒˈ-, pʁɔvɑ̃s) is a geographical region and historical province of southeastern France, which extends from the left bank of the lower Rhône to the west to the Italian border to the east; it is bordered by the Mediterranean Sea to the south. It largely corresponds with the modern administrative region of Provence-Alpes-Côte d'Azur and includes the departments of Var, Bouches-du-Rhône, Alpes-de-Haute-Provence, as well as parts of Alpes-Maritimes and Vaucluse.
Aix-en-Provence
Aix-en-Provence (UKˌɛks_ɒ̃_prɒˈvɒ̃s, USˌeɪks_ɒ̃_proʊˈvɒ̃s,ˌɛks-), or simply Aix (medieval Occitan: Aics), is a city and commune in southern France, about north of Marseille. A former capital of Provence, it is the subprefecture of the arrondissement of Aix-en-Provence, in the department of Bouches-du-Rhône, in the region of Provence-Alpes-Côte d'Azur. The population of Aix-en-Provence is approximately 145,000. Its inhabitants are called Aixois or, less commonly, Aquisextains.
First-class function
In computer science, a programming language is said to have first-class functions if it treats functions as first-class citizens. This means the language supports passing functions as arguments to other functions, returning them as the values from other functions, and assigning them to variables or storing them in data structures. Some programming language theorists require support for anonymous functions (function literals) as well.
Smoothness
In mathematical analysis, the smoothness of a function is a property measured by the number of continuous derivatives it has over some domain, called differentiability class. At the very minimum, a function could be considered smooth if it is differentiable everywhere (hence continuous). At the other end, it might also possess derivatives of all orders in its domain, in which case it is said to be infinitely differentiable and referred to as a C-infinity function (or function).
Bounded set
In mathematical analysis and related areas of mathematics, a set is called bounded if it is, in a certain sense, of finite measure. Conversely, a set which is not bounded is called unbounded. The word "bounded" makes no sense in a general topological space without a corresponding metric. Boundary is a distinct concept: for example, a circle in isolation is a boundaryless bounded set, while the half plane is unbounded yet has a boundary. A bounded set is not necessarily a closed set and vice versa.
Functional programming
In computer science, functional programming is a programming paradigm where programs are constructed by applying and composing functions. It is a declarative programming paradigm in which function definitions are trees of expressions that map values to other values, rather than a sequence of imperative statements which update the running state of the program. In functional programming, functions are treated as first-class citizens, meaning that they can be bound to names (including local identifiers), passed as arguments, and returned from other functions, just as any other data type can.
Non-analytic smooth function
In mathematics, smooth functions (also called infinitely differentiable functions) and analytic functions are two very important types of functions. One can easily prove that any analytic function of a real argument is smooth. The converse is not true, as demonstrated with the counterexample below. One of the most important applications of smooth functions with compact support is the construction of so-called mollifiers, which are important in theories of generalized functions, such as Laurent Schwartz's theory of distributions.
Automated theorem proving
Automated theorem proving (also known as ATP or automated deduction) is a subfield of automated reasoning and mathematical logic dealing with proving mathematical theorems by computer programs. Automated reasoning over mathematical proof was a major impetus for the development of computer science. While the roots of formalised logic go back to Aristotle, the end of the 19th and early 20th centuries saw the development of modern logic and formalised mathematics.
Smooth structure
In mathematics, a smooth structure on a manifold allows for an unambiguous notion of smooth function. In particular, a smooth structure allows one to perform mathematical analysis on the manifold. A smooth structure on a manifold is a collection of smoothly equivalent smooth atlases. Here, a smooth atlas for a topological manifold is an atlas for such that each transition function is a smooth map, and two smooth atlases for are smoothly equivalent provided their union is again a smooth atlas for This gives a natural equivalence relation on the set of smooth atlases.
Extreme value theorem
In calculus, the extreme value theorem states that if a real-valued function is continuous on the closed interval , then must attain a maximum and a minimum, each at least once. That is, there exist numbers and in such that: The extreme value theorem is more specific than the related boundedness theorem, which states merely that a continuous function on the closed interval is bounded on that interval; that is, there exist real numbers and such that: This does not say that and are necessarily the maximum and minimum values of on the interval which is what the extreme value theorem stipulates must also be the case.