Given a specific task to solve, and a class of functions, learning means using a set of observations to find which solves the task in some optimal sense.

Given two school classes, one with 20 students, and one with 30 students, the grades in each class on a test were:

Given a general statement such as all ravens are black, a form of the same statement that refers to a specific observable instance of the general class would typically be considered to constitute evidence for that general statement.

Given that Rothko had known in advance about the luxury decor of the restaurant and the social class of its future patrons, the exact motives for his abrupt repudiation remain mysterious.

Given a case for which the class is unknown, guess that it belongs to the same class as the majority in its immediate neighborhood.

Given an integer k, one defines the residue class of an integer n as the set of all integers congruent to n modulo k:

Given an oriented manifold M of dimension n with fundamental class, and a G-bundle with characteristic classes, one can pair a product of characteristic classes of total degree n with the fundamental class.

A more general class are flat G-bundles with for a manifold F. Given a representation, the flat-bundle with monodromy is given by, where acts on the universal cover by deck transformations and on F by means of the representation.

Given a real vector bundle E over M, its k-th Pontryagin class is defined as

Given this closure property for CSAs, they form a monoid under tensor product, compatible with Brauer equivalence, and the Brauer classes are all invertible: the inverse class to that of an algebra A is the one containing the opposite algebra A < sup > op </ sup > ( the opposite ring with the same action by K since the image of K → A is in the center of A ).

The general scenario is the following: Given a class S of computable functions, is there a learner ( that is, recursive functional ) which for any input of the form ( f ( 0 ), f ( 1 ),..., f ( n )) outputs a hypothesis ( an index e with respect to a previously agreed on acceptable numbering of all computable functions ; the indexed function should be consistent with the given values of f ).

Given a partially ordered class P, we can form a category with P's elements as objects and a single arrow going from one object ( element ) to another if the first is less than or equal to the second.

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 pair of spaces ( X, A ) the mapping class group of the pair is the isotopy-classes of automorphisms of the pair, where an automorphism of ( X, A ) is defined as an automorphism of X that preserves A, i. e. f: X → X is invertible and f ( A )

Given that we are only interested in what happens on shell, we would often take the quotient by the ideal generated by the Euler-Lagrange equations, or in other words, consider the equivalence class of functionals / flows which agree on shell.

Given two groups of people, the interaction between them is such that a behavior X from one side elicits a behavior Y from the other side, The two behaviors complement one another, exemplified in the dominant-submissive behaviors of a class struggle.

Given the dominance of West Indian bowling at the time, and the fragility of the Australian batting line-up, Wessels ' performance during that series was world class.

Given special funding by the Provincial Government, the school hired George Curtis from Dalhousie's Faculty of Law to serve as their first Dean and within two months the Faculty was educating its first incoming class.

Given that disadvantaged students generally have fewer opportunities to learn academic content outside of school, wasted class time due to an unfocused lesson presents a particular problem.

Given that the North Shore portions of the riding were largely affluent and upper middle class in character and normally a Liberal bastion, Douglas ' strong showing is not so surprising given the working-class and labour background of much of even the better-off parts of the riding in Burnaby.

Given that Canada had a relatively poor track record at producing world class soccer talent, Montreal fans were likely put off by the prospect that the quality of the team's play would instantly diminish for the 1984 season.

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

Given a function of type, currying produces.

Given the definition of above, we might fix ( or ' bind ') the first argument, producing a function of type.

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 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 a vector space V over the field R of real numbers, a function is called sublinear if

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 function f of a real variable x and an interval of the real line, the definite integral

Given that estimation is undertaken on the basis of a least squares analysis, estimates of the unknown parameters β < sub > j </ sub > are determined by minimising a sum of squares function

Given a set of training examples of the form, a learning algorithm seeks a function, where is the input space and

Given an arithmetic function, one can generate a bi-infinite sequence of other arithmetic functions by repeatedly applying the first summation.

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 a relation, scaling the argument by a constant factor causes only a proportionate scaling of the function itself.

# Composition operator ( also called the substitution operator ): Given an m-ary function and m k-ary functions:

# Primitive recursion operator: Given the k-ary function and k + 2-ary function:

# Minimisation operator: Given a ( k + 1 )- ary total function:

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