[permalink] [id link]
* Every continuous plurisubharmonic function can be obtained as a limit of monotonically decreasing sequence of smooth plurisubharmonic functions.
from
Wikipedia
Some Related Sentences
Every and continuous
* Every continuous functor on a small-complete category which satisfies the appropriate solution set condition has a left-adjoint ( the Freyd adjoint functor theorem ).
Every character is automatically continuous from A to C, since the kernel of a character is a maximal ideal, which is closed.
* Every continuous map from a compact space to a Hausdorff space is closed and proper ( i. e., the pre-image of a compact set is compact.
Every contraction mapping is Lipschitz continuous and hence uniformly continuous ( for a Lipschitz continuous function, the constant k is no longer necessarily less than 1 ).
Every continuous map f: X → Y induces an algebra homomorphism C ( f ): C ( Y ) → C ( X ) by the rule C ( f )( φ ) = φ o f for every φ in C ( Y ).
* Every separable metric space is isometric to a subset of C (), the separable Banach space of continuous functions → R, with the supremum norm.
Every topological group can be viewed as a uniform space in two ways ; the left uniformity turns all left multiplications into uniformly continuous maps while the right uniformity turns all right multiplications into uniformly continuous maps.
Every continuous function in the function space can be represented as a linear combination of basis functions, just as every vector in a vector space can be represented as a linear combination of basis vectors.
Every map that is injective, continuous and either open or closed is an embedding ; however there are also embeddings which are neither open nor closed.
* Every compact Hausdorff space of weight at most ( see Aleph number ) is the continuous image of ( this does not need the continuum hypothesis, but is less interesting in its absence ).
Every place south of the Antarctic Circle experiences a period of twenty-four hours ' continuous daylight at least once per year, and a period of twenty-four hours ' continuous night time at least once per year.
Every and function
Every such subset has a smallest element, so to specify our choice function we can simply say that it maps each set to the least element of that set.
Every effectively calculable function ( effectively decidable predicate ) is general recursive italics
Every bijective function g has an inverse g < sup >− 1 </ sup >, such that gg < sup >− 1 </ sup > = I ;
Every entire function can be represented as a power series that converges uniformly on compact sets.
Every holomorphic function can be separated into its real and imaginary parts, and each of these is a solution of Laplace's equation on R < sup > 2 </ sup >.
Every completely multiplicative function is a homomorphism of monoids and is completely determined by its restriction to the prime numbers.
Every time another object or customer enters the line to wait, they join the end of the line and represent the “ enqueue ” function.
Every type that is a member of the type class defines a function that will extract the data from the string representation of the dumped data.
Every output of an encoder can be described by its own transfer function, which is closely related to the generator polynomial.
Every and can
Every information exchange between living organisms — i. e. transmission of signals that involve a living sender and receiver can be considered a form of communication ; and even primitive creatures such as corals are competent to communicate.
Every context-sensitive grammar which does not generate the empty string can be transformed into an equivalent one in Kuroda normal form.
Every grammar in Chomsky normal form is context-free, and conversely, every context-free grammar can be transformed into an equivalent one which is in Chomsky normal form.
Every module over a division ring has a basis ; linear maps between finite-dimensional modules over a division ring can be described by matrices, and the Gaussian elimination algorithm remains applicable.
Group actions / representations: Every group G can be considered as a category with a single object whose morphisms are the elements of G. A functor from G to Set is then nothing but a group action of G on a particular set, i. e. a G-set.
Every sequence can, thus, be read in three reading frames, each of which will produce a different amino acid sequence ( in the given example, Gly-Lys-Pro, Gly-Asn, or Glu-Thr, respectively ).
Every hyperbola is congruent to the origin-centered East-West opening hyperbola sharing its same eccentricity ε ( its shape, or degree of " spread "), and is also congruent to the origin-centered North-South opening hyperbola with identical eccentricity ε — that is, it can be rotated so that it opens in the desired direction and can be translated ( rigidly moved in the plane ) so that it is centered at the origin.
Every species can be given a unique ( and, one hopes, stable ) name, as compared with common names that are often neither unique nor consistent from place to place and language to language.
Every vector v in determines a linear map from R to taking 1 to v, which can be thought of as a Lie algebra homomorphism.
Every use of modus tollens can be converted to a use of modus ponens and one use of transposition to the premise which is a material implication.
Every adult, healthy, sane Muslim who has the financial and physical capacity to travel to Mecca and can make arrangements for the care of his / her dependants during the trip, must perform the Hajj once in a lifetime.
* Every finite topological space gives rise to a preorder on its points, in which x ≤ y if and only if x belongs to every neighborhood of y, and every finite preorder can be formed as the specialization preorder of a topological space in this way.
* Every preorder can be given a topology, the Alexandrov topology ; and indeed, every preorder on a set is in one-to-one correspondence with an Alexandrov topology on that set.
Every binary relation R on a set S can be extended to a preorder on S by taking the transitive closure and reflexive closure, R < sup >+=</ sup >.
0.191 seconds.