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 a function f of type, currying it makes a function.

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 two manifolds M and N, a bijective map f from M to N is called a diffeomorphism if both

Given a subset X of a manifold M and a subset Y of a manifold N, a function f: X → Y is said to be smooth if for all p in X there is a neighborhood of p and a smooth function g: U → N such that the restrictions agree ( note that g is an extension of f ).

Given two groups G and H and a group homomorphism f: G → H, let K be a normal subgroup in G and φ the natural surjective homomorphism G → G / K ( where G / K is a quotient group ).

Given a trigonometric series f ( x ) with S as its set of zeros, Cantor had discovered a procedure that produced another trigonometric series that had S ' as its set of zeros, where S ' is the set of limit points of S. If p ( 1 ) is the set of limit points of S, then he could construct a trigonometric series whose zeros are p ( 1 ).

Given the laws of exponents, f ( x )

Given a function f of a real variable x and an interval of the real line, the definite integral

Given a function ƒ defined over the reals x, and its derivative ƒ < nowiki > '</ nowiki >, we begin with a first guess x < sub > 0 </ sub > for a root of the function f. Provided the function is reasonably well-behaved a better approximation x < sub > 1 </ sub > is

# Given any point x in X, and any sequence in X converging to x, the composition of f with this sequence converges to f ( x )

Given f

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 morphism f: B → A the associated natural transformation is denoted Hom ( f ,–).

Given the space X = Spec ( R ) with the Zariski topology, the structure sheaf O < sub > X </ sub > is defined on the D < sub > f </ sub > by setting Γ ( D < sub > f </ sub >, O < sub > X </ sub >) = R < sub > f </ sub >, the localization of R at the multiplicative system

Given x ∈ A, the holomorphic functional calculus allows to define ƒ ( x ) ∈ A for any function ƒ holomorphic in a neighborhood of Furthermore, the spectral mapping theorem holds:

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 a recursively enumerable set A of positive integers that has insoluble membership problem, ⟨ a, b, c, d | a < sup > n </ sup > ba < sup > n </ sup > = c < sup > n </ sup > dc < sup > n </ sup >: n ∈ A ⟩ is a finitely generated group with a recursively enumerable presentation whose word problem is insoluble

Given a topological space X, denote F the set of filters on X, x ∈ X a point, V ( x ) ∈ F the neighborhood filter of x, A ∈ F a particular filter and the set of filters finer than A and that converge to x.

Given a vector x ∈ V and y * ∈ W *, then the tensor product y * ⊗ x corresponds to the map A: W → V given by

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 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 graph Λ ( for example, a d-dimensional lattice ), per each lattice site j ∈ Λ there is a discrete variable σ < sub > j </ sub > such that σ < sub > j </ sub > ∈

Given *- representations π, π ' each with unit norm cyclic vectors ξ ∈ H, ξ ' ∈ K such that their respective associated states coincide, then π, π ' are unitarily equivalent representations.

For a finite group G, the left regular representation λ ( over a field K ) is a linear representation on the K-vector space V whose basis is the elements of G. Given g ∈ G, λ ( g ) is the linear map determined by its action on the basis by left translation by g, i. e.

Given a function and an element g ∈ G,

* Given a maximal torus T in G, every element g ∈ G is conjugate to an element in T.

Given a ∈ A, one defines the function by.

Given a labelled state transition system ( S, Λ, →), a simulation relation is a binary relation R over S ( i. e. R ⊆ S × S ) such that for every pair of elements p, q ∈ S, if ( p, q )∈ R then for all α ∈ Λ, and for all p ' ∈ S,

Given a group G, a factor group G / N is abelian if and only if ≤ N.

* Given a partition of A, G is a transformation group under composition, whose orbits are the cells of the partition ‡;

* Given a transformation group G over A, there exists an equivalence relation ~ over A, whose equivalence classes are the orbits of G.

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 a groupoid in the category-theoretic sense, let G be the disjoint union of all of the sets G ( x, y ) ( i. e. the sets of morphisms from x to y ).

Given a groupoid G, the vertex groups or isotropy groups or object groups in G are the subsets of the form G ( x, x ), where x is any object of G. It follows easily from the axioms above that these are indeed groups, as every pair of elements is composable and inverses are in the same vertex group.

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

Given an arbitrary group G, there is a related profinite group G < sup >^</ sup >, the profinite completion of G. It is defined as the inverse limit of the groups G / N, where N runs through the normal subgroups in G of finite index ( these normal subgroups are partially ordered by inclusion, which translates into an inverse system of natural homomorphisms between the quotients ).

* 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 ).

Given a binary operation ★ on a set S, an element x is said to be idempotent ( with respect to ★) if

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 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 smooth Φ < sup > t </ sup >, an autonomous vector field can be derived from it.

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 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