Help


[permalink] [id link]
+
Page "Equality (mathematics)" ¶ 7
from Wikipedia
Edit
Promote Demote Fragment Fix

Some Related Sentences

Given and any
: Given any family of nonempty sets, their Cartesian product is a nonempty set.
: Given any set X of pairwise disjoint non-empty sets, there exists at least one set C that contains exactly one element in common with each of the sets in X.
Given that John of Worcester wrote his chronicle after the eruption of the Canterbury – York supremacy struggle, the story of Ealdred renouncing any claims to Worcester needs to be considered suspect.
Given the absolute magnitude, for objects within our galaxy you can also calculate the apparent magnitude from any distance ( in parsecs ):
* Given any Banach space X, the continuous linear operators A: X → X form a unitary associative algebra ( using composition of operators as multiplication ); this is a Banach algebra.
* Given any topological space X, the continuous real-or complex-valued functions on X form a real or complex unitary associative algebra ; here the functions are added and multiplied pointwise.
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 any expression involving complex numbers, bras, kets, inner products, outer products, and / or linear operators ( but not addition ), written in bra-ket notation, the parenthetical groupings do not matter ( i. e., the associative property holds ).
* Given any combination of complex numbers, bras, kets, inner products, outer products, and / or linear operators, written in bra-ket notation, its Hermitian conjugate can be computed by reversing the order of the components, and taking the Hermitian conjugate of each.
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 that a natural language such as English contains, at any given time, a finite number of words, any comprehensive list of definitions must either be circular or rely upon primitive notions.
Given any vector space V over a field F, the dual space V * is defined as the set of all linear maps ( linear functionals ).
* Given any set X, there is an equivalence relation over the set of all possible functions X → X.
Given a left neutral element and for any given then A4 ’ says there exists an such that.
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 that Gable and Cukor had worked together before, in Manhattan Melodrama and Gable had no objection to working with him then, and given Selznick's desperation to get Gable for Rhett Butler, if Gable had any objections to Cukor, certainly they would have been expressed before he signed his contract for the film.
On poverty, Hoover said that " Given the chance to go forward with the policies of the last eight years, we shall soon with the help of God, be in sight of the day when poverty will be banished from this nation ", and promised, " We in America today are nearer to the final triumph over poverty than ever before in the history of any land ," but within months, the Stock Market Crash of 1929 occurred, and the world's economy spiraled downward into the Great Depression.
Given the state at some initial time ( t = 0 ), we can solve it to obtain the state at any subsequent time.
We have seen a few cavities of the appropriate size and shape for ivory-bills, but these can be old, or exceptionally large Pileated Woodpecker cavities, or mammal-enlarged Pileated Woodpecker cavities .… Given the results, it is unlikely a population of any meaningful size of Ivory-billed Woodpeckers exists in south Florida.
Given a general algorithm for integer factorization, one can factor any integer down to its constituent prime factors by repeated application of this algorithm.
Given the above-mentioned problems, regulators face the challenging task of regulating a market that is changing very rapidly, without stifling any type of innovation, and without improperly disadvantaging any competitor.
Given that the cost of replacing an executive can run over 100 % of his or her annual salary, any investment of time and energy in re-recruitment will likely pay for itself many times over if it helps a business retain just a handful of key players that would have otherwise left.
: Given any positive number ε, there is a sequence

Given and x
* 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 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 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 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 the laws of exponents, f ( x )
Given a binary operation ★ on a set S, an element x is said to be idempotent ( with respect to ★) if
Given a function f of a real variable x and an interval of the real line, the definite integral

Given and y
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 xy to mean yxP. 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 two metric spaces ( X, d < sub > X </ sub >) and ( Y, d < sub > Y </ sub >), where d < sub > X </ sub > denotes the metric on the set X and d < sub > Y </ sub > is the metric on set Y ( for example, Y might be the set of real numbers R with the metric d < sub > Y </ sub >( x, y )
Given a Boolean ring R, for x and y in R we can define
Given the sphere defined by the points ( x, y, z ) such that
Given two variables x and y, y is directly proportional to x ( x and y vary directly, or x and y are in direct variation ) if there is a non-zero constant k such that

Given and =
Given Ω microstates at a particular energy, the probability of finding the system in a particular microstate is p = 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 finite presentation P =
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
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 a set of variable symbols X =
# 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 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 any subset F =
Given a ring R and a unit u in R, the map ƒ ( x ) = u < sup >− 1 </ sup > xu is a ring automorphism of R. The ring automorphisms of this form are called inner automorphisms of R. They form a normal subgroup of the automorphism group of R.
Given ω = (,, zθ ), with v = ( x, y, z ) a unit vector, the correct skew-symmetric matrix form of ω is
Given: side a = 20, side c = 24, and angle C = 40 °
Given the time reversal operator T, it does nothing to the x-operator, TxT < sup >− 1 </ sup > =
Given a concrete category ( C, U ) and a cardinal number N, let U < sup > N </ sup > be the functor C → Set determined by U < sup > N </ sup >( c ) = ( U ( c ))< sup > N </ sup >.

0.265 seconds.