Search Results for ""

A lattice-ordered set is a poset (L,<=) in which each two-element subset {a,b} has an infimum, denoted inf{a,b}, and a supremum, denoted sup{a,b}. There is a natural ...

An algebra <L; ^ , v > is called a lattice if L is a nonempty set, ^ and v are binary operations on L, both ^ and v are idempotent, commutative, and associative, and they ...

In functional analysis, the Lax-Milgram theorem is a sort of representation theorem for bounded linear functionals on a Hilbert space H. The result is of tantamount ...

A linear transformation between two vector spaces V and W is a map T:V->W such that the following hold: 1. T(v_1+v_2)=T(v_1)+T(v_2) for any vectors v_1 and v_2 in V, and 2. ...

Let L=(L, ^ , v ) be a lattice, and let f,g:L->L. Then the pair (f,g) is a local polarity if and only if for each finite set X subset= L, there is a finitely generated ...

Partial derivatives are defined as derivatives of a function of multiple variables when all but the variable of interest are held fixed during the differentiation. (1) The ...

Define a pebbling move as a transer of two pebbles from one vertex of a graph edge to an adjacent vertex with one of the pebbles being removed in transit as a toll. The ...

Every nonconstant entire function attains every complex value with at most one exception (Henrici 1988, p. 216; Apostol 1997). Furthermore, every analytic function assumes ...

There are nine possible types of isolated singularities on a cubic surface, eight of them rational double points. Each type of isolated singularity has an associated normal ...

A sequent is an expression Gamma|-Lambda, where Gamma and Lambda are (possibly empty) sequences of formulas. Here, Gamma is called the antecedent and Lambda is called the ...