Given a vector v in R < sup > n </ sup > one defines the directional derivative of a smooth map ƒ: R < sup > n </ sup >→ R at a point x by

# Given u and v in W, then they can be expressed as u = ( u < sub > 1 </ sub >, u < sub > 2 </ sub >, 0 ) and v = ( v < sub > 1 </ sub >, v < sub > 2 </ sub >, 0 ).

Given ω = ( xθ, yθ, zθ ), with v = ( x, y, z ) a unit vector, the correct skew-symmetric matrix form of ω is

Given a Hermitian form Ψ on a complex vector space V, the unitary group U ( Ψ ) is the group of transforms that preserve the form: the transform M such that Ψ ( Mv, Mw ) = Ψ ( v, w ) for all v, w ∈ V. In terms of matrices, representing the form by a matrix denoted, this says that.

Given a graph G with n vertices, the closure cl ( G ) is uniquely constructed from G by repeatedly adding a new edge uv connecting a nonadjacent pair of vertices u and v with until no more pairs with this property can be found.

Given a set S of matrices, each of which is diagonalizable, and any two of which commute, it is always possible to simultaneously diagonalize all of the elements of S. Equivalently, for any set S of mutually commuting semisimple linear transformations of a finite-dimensional vector space V there exists a basis of V consisting of simultaneous eigenvectors of all elements of S. Each of these common eigenvectors v ∈ V, defines a linear functional on the subalgebra U of End ( V ) generated by the set of endomorphisms S ; this functional is defined as the map which associates to each element of U its eigenvalue on the eigenvector v. This " generalized eigenvalue " is a prototype for the notion of a weight.

Given a Riemannian manifold and two linearly independent tangent vectors at the same point, u and v, we can define

Given only a short time to prepare, Wei was only able to demonstrate Viola's equivalent capabilities for local rather than remote files at the 2003 Eolas v. Microsoft trial, and thus fell short of proving prior art to the court's satisfaction.

Given three vertices v, u, and w, where ( v, u ) and ( u, w ) are edges in the graph, the lifting of vuw, or equivalent of ( v, u ), ( u, w ) is the operation that deletes the two edges ( v, u ) and ( u, w ) and adds the edge ( u, w ).

Given a unit sphere, a " triangle " on the surface of the sphere is defined by the great circles connecting three points u, v, and w on the sphere.

Given some value v and its approximation v < sub > approx </ sub >, the absolute error is

Given a perfect graph G, Lovász forms a graph G * by replacing each vertex v by a clique of t < sub > v </ sub > vertices, where t < sub > v </ sub > is the number of distinct maximum independent sets in G that contain v. It is possible to correspond each of the distinct maximum independent sets in G with one of the maximum independent sets in G *, in such a way that the chosen maximum independent sets in G * are all disjoint and each vertex of G * appears in a single chosen set ; that is, G * has a coloring in which each color class is a maximum independent set.

Given a graph G and given a set L ( v ) of colors for each vertex v ( called a list ), a list coloring is a choice function that maps every vertex v to a color in the list L ( v ).

* Given an R-module M, the endomorphism ring of M, denoted End < sub > R </ sub >( M ) is an R-algebra by defining ( r · φ )( x ) = r · φ ( x ).

After Christians in Ephesus first wrote to their counterparts recommending Apollos to them, he went to Achaia where Paul names him as an apostle ( 1 Cor 4: 6, 9-13 ) Given that Paul only saw himself as an apostle ' untimely born ' ( 1 Cor 15: 8 ) it is certain that Apollos became an apostle in the regular way ( as a witness to the risen Lord and commissioned by Jesus-1 Cor 15: 5-9 ; 1 Cor 9: 1 ).< ref > So the Alexandrian recension ; the text in < sup > 38 </ sup > and Codex Bezae indicate that Apollos went to Corinth.

Given any element x of X, there is a function f < sup > x </ sup >, or f ( x ,·), from Y to Z, given by f < sup > x </ sup >( y ) := f ( x, y ).

Given points P < sub > 0 </ sub > and P < sub > 1 </ sub >, a linear Bézier curve is simply a straight line between those two points.

Given the first n digits of Ω and a k ≤ n, the algorithm enumerates the domain of F until enough elements of the domain have been found so that the probability they represent is within 2 < sup >-( k + 1 )</ sup > of Ω.

Given a function f ∈ I < sub > x </ sub > ( a smooth function vanishing at x ) we can form the linear functional df < sub > x </ sub > as above.

) Given a smooth Φ < sup > t </ sup >, an autonomous vector field can be derived from it.

Given two groups (< var > G </ var >, *) and (< var > H </ var >, ), a group isomorphism from (< var > G </ var >, *) to (< var > H </ var >, ) is a bijective group homomorphism from < var > G </ var > to < var > H </ var >.

Given f ∈ G ( x * x < sup >- 1 </ sup >, y * y < sup >-1 </ sup >) and g ∈ G ( y * y < sup >-1 </ sup >, z * z < sup >-1 </ sup >), their composite is defined as g * f ∈ G ( x * x < sup >-1 </ sup >, z * z < sup >-1 </ sup >).

Given a field K, the corresponding general linear groupoid GL < sub >*</ sub >( K ) consists of all invertible matrices whose entries range over K. Matrix multiplication interprets composition.

Given a topological space X, let G < sub > 0 </ sub > be the set X.

Given a complex-valued function ƒ of a single complex variable, the derivative of ƒ at a point z < sub > 0 </ sub > in its domain is defined by the limit

Given a polynomial of degree with zeros < math > z_n < z_

Given a ( random ) sample the relation between the observations Y < sub > i </ sub > and the independent variables X < sub > ij </ sub > is formulated as

Given the need for such fine regulation of Ca < sup > 2 +</ sup > signaling, it is perhaps unsurprising that dysregulated mitochondrial Ca < sup > 2 +</ sup > has been implicated in several neurodegenerative diseases, while the catalogue of tumor suppressors includes a few that are enriched at the MAM.

Idealists are skeptics about the physical world, maintaining either: 1 ) that nothing exists outside the mind, or 2 ) that we would have no access to a mind-independent reality even if it may exist ; the latter case often takes the form of a denial of the idea that we can have unconceptualised experiences ( see Myth of the Given ).

Given the rigorous admission process it is not surprising that CUNY BA boasts a 70 % graduation rate within an average of 2. 2 years and that 60 % graduate with academic honors.

:( b ) Given player 1's strategy, the best payoff possible for player 2 is − V.

Given a field ordering ≤ as in Def 1, the elements such that x ≥ 0 forms a positive cone of F. Conversely, given a positive cone P of F as in Def 2, one can associate a total ordering ≤< sub > P </ sub > by setting x ≤ y to mean y − x ∈ P. This total ordering ≤< sub > P </ sub > satisfies the properties of Def 1.

Given two points ( x < sub > 1 </ sub >, y < sub > 1 </ sub >) and ( x < sub > 2 </ sub >, y < sub > 2 </ sub >), the change in x from one to the other is ( run ), while the change in y is ( rise ).

Given metric spaces ( X, d < sub > 1 </ sub >) and ( Y, d < sub > 2 </ sub >), a function f: X → Y is called uniformly continuous if for every real number ε > 0 there exists δ > 0 such that for every x, y ∈ X with d < sub > 1 </ sub >( x, y ) < δ, we have that d < sub > 2 </ sub >( f ( x ), f ( y )) < ε.

Given a Hilbert space L < sup > 2 </ sup >( m ), m being a finite measure, the inner product < ·, · > gives rise to a positive functional φ by

The quantum circuits used for this algorithm are custom designed for each choice of N and the random a used in f ( x ) = a < sup > x </ sup > mod N. Given N, find Q = 2 < sup > q </ sup > such that < math > N ^ 2

# Given u in W and a scalar c in R, if u = ( u < sub > 1 </ sub >, u < sub > 2 </ sub >, 0 ) again, then cu = ( cu < sub > 1 </ sub >, cu < sub > 2 </ sub >, c0 ) = ( cu < sub > 1 </ sub >, cu < sub > 2 </ sub >, 0 ).

Given a set A of N people, it has 2 < sup > N </ sup > possible subsets.

Given a 5 % male excess birth rate, there appears to be 3. 15 male SIDS cases per 2 female, for a male fraction of 0. 61.

Given a codeword, there are roughly 2 < sup > n H ( p )</ sup > typical output sequences.

Given some " primitive formulas " such as PM's primitives S < sub > 1 </ sub > V S < sub > 2 </ sub > OR, ~ S ( negation ) one is forced to define the axioms in terms of these primitive notions.

Given an adequate supply of food, larvae should pupate and weave a silken cocoon within 1 – 2 weeks after 3 larval stages.