* Let H be a group, and let G be the direct product H × H. Then the subgroups

Moving to groups in general, let H be a subgroup of some group G. Let ~ be an equivalence relation on G, such that a ~ b ↔ ( ab < sup >− 1 </ sup > ∈ H ).

Let A be the arithmetic mean and H be the harmonic mean of n positive real numbers.

Let H be a Hilbert space, and let H * denote its dual space, consisting of all continuous linear functionals from H into the field R or C. If x is an element of H, then the function φ < sub > x </ sub >, defined by

Let be the probability that a certain coin lands heads up ( H ) when tossed.

Let G and H be groups, and let φ: G → H be a homomorphism.

Let G be a group with identity element e, N a normal subgroup of G ( i. e., N ◁ G ) and H a subgroup of G. The following statements are equivalent:

Let H be the hashing function and m the message:

Let gas 1 be H < sub > 2 </ sub > and gas 2 be O < sub > 2 </ sub >.

Let A and H be groups and Ω a set with H acting on it.

Let us assume that H < sub > f </ sub > is in this time complexity class, and we will attempt to reach a contradiction.

Let p ( n ; H ) be the probability that during this experiment at least one value is chosen more than once.

Let n ( p ; H ) be the smallest number of values we have to choose, such that the probability for finding a collision is at least p. By inverting this expression above, we find the following approximation

Let Q ( H ) be the expected number of values we have to choose before finding the first collision.

Let U be a unitary operator on a Hilbert space H ; more generally, an isometric linear operator ( that is, a not necessarily surjective linear operator satisfying ‖ Ux ‖

Let the coin tosses be represented by a sequence of independent random variables, each of which is equal to H with probability p, and T with probability Let N be time of appearance of the first H ; in other words,, and If the coin never shows H, we write N is itself a random variable because it depends on the random outcomes of the coin tosses.

Let ( m, n ) be a pair of amicable numbers with m < n, and write m = gM and n = gN where g is the greatest common divisor of m and n. If M and N are both coprime to g and square free then the pair ( m, n ) is said to be regular, otherwise it is called irregular or exotic.

Let denote the Bézier curve determined by the points P < sub > 0 </ sub >, P < sub > 1 </ sub >, ..., P < sub > n </ sub >.

Let P < sub > F </ sub > be the domain of a prefix-free universal computable function F. The constant Ω < sub > F </ sub > is then defined as

Let M be a smooth manifold and let x be a point in M. Let T < sub > x </ sub > M be the tangent space at x.

Let M be a smooth manifold and let x be a point in M. Let I < sub > x </ sub > be the ideal of all functions in C < sup >∞</ sup >( M ) vanishing at x, and let I < sub > x </ sub >< sup > 2 </ sup > be the set of functions of the form, where f < sub > i </ sub >, g < sub > i </ sub > ∈ I < sub > x </ sub >.

Let M be a smooth manifold and let f ∈ C < sup >∞</ sup >( M ) be a smooth function.

Let e be the error in b. Assuming that A is a square matrix, the error in the solution A < sup >− 1 </ sup > b is A < sup >− 1 </ sup > e.

Let us for simplicity take, then < math > 0 < c =- 2a </ math > and.

Let r be a non zero real number and let the r < sup > th </ sup > power mean ( M < sup > r </ sup > ) of a series of real variables ( a < sub > 1 </ sub >, a < sub > 2 </ sub >, a < sub > 3 </ sub >, ... ) be defined as

Let t and s ( t > s ) be the sides of the two inscribed squares in a right triangle with hypotenuse c. Then s < sup > 2 </ sup > equals half the harmonic mean of c < sup > 2 </ sup > and t < sup > 2 </ sup >.

* Let Q be a set enclosed between two step regions S and T. A step region is formed from a finite union of adjacent rectangles resting on a common base, i. e. S ⊆ Q ⊆ T. If there is a unique number c such that a ( S ) ≤ c ≤ a ( T ) for all such step regions S and T, then a ( Q )

Let X be some repeatable process, and i be some point in time after the start of that process.

Let x, y, z be a system of Cartesian coordinates in 3-dimensional Euclidean space, and let i, j, k be the corresponding basis of unit vectors.

Let X < sub > i </ sub > be the measured weight of the ith object, for i

Let ( A < sub > i </ sub >)< sub > i ∈ I </ sub > be a family of groups and suppose we have a family of homomorphisms f < sub > ij </ sub >: A < sub > j </ sub > → A < sub > i </ sub > for all i ≤ j ( note the order ) with the following properties:

Let ( X < sub > i </ sub >, f < sub > ij </ sub >) be an inverse system of objects and morphisms in a category C ( same definition as above ).

* Let the index set I of an inverse system ( X < sub > i </ sub >, f < sub > ij </ sub >) have a greatest element m. Then the natural projection π < sub > m </ sub >: X → X < sub > m </ sub > is an isomorphism.

* Let I consist of three elements i, j, and k with i ≤ j and i ≤ k ( not directed ).

Let the mutation rate correspond to the probability that a j type parent will produce an i type organism.

If V is a real vector space, then we replace V by its complexification V ⊗< sub > R </ sub > C and let g denote the induced bilinear form on V ⊗< sub > R </ sub > C. Let W be a maximal isotropic subspace, i. e. a maximal subspace of V such that g |< sub > W </ sub > = 0.

Let J be a directed poset ( considered as a small category by adding arrows i → j if and only if i ≤ j ) and let F: J < sup > op </ sup > → C be a diagram.

Let be a set with a binary operation ( i. e., a magma ).

Let ( S, f ) be a game with n players, where S < sub > i </ sub > is the strategy set for player i, S = S < sub > 1 </ sub > × S < sub > 2 </ sub > ... × S < sub > n </ sub > is the set of strategy profiles and f =( f < sub > 1 </ sub >( x ), ..., f < sub > n </ sub >( x )) is the payoff function for x S. Let x < sub > i </ sub > be a strategy profile of player i and x < sub >- i </ sub > be a strategy profile of all players except for player i. When each player i < nowiki >

Genesis 1: 9 " And God said, Let the waters be collected ". Letters in black, < font color ="# CC0000 "> niqqud in red </ font >, < font color ="# 0000CC "> cantillation in blue </ font >

* Let D < sub > 1 </ sub > and D < sub > 2 </ sub > be directed sets.