TOPICS
Search

Search Results for ""


1161 - 1170 of 2464 for First Isomorphism TheoremSearch Results
An equalizer of a pair of maps f,g:X->Y in a category is a map e:E->X such that 1. f degreese=g degreese, where degrees denotes composition. 2. For any other map e^':E^'->X ...
A field automorphism of a field F is a bijective map sigma:F->F that preserves all of F's algebraic properties, more precisely, it is an isomorphism. For example, complex ...
An edge subdivision is the insertion of a new vertex v_j in the middle of an exiting edge e=v_iv_k accompanied by the joining of the original edge endpoints with the new ...
A homogeneous space M is a space with a transitive group action by a Lie group. Because a transitive group action implies that there is only one group orbit, M is isomorphic ...
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If h is one-to-one and is a join-homomorphism, then it is a join-embedding.
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If K=L and h is a join-homomorphism, then we call h a join-endomorphism.
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. Then the mapping h is a join-homomorphism provided that for any x,y in L, h(x v y)=h(x) v h(y). It is also ...
A lattice automorphism is a lattice endomorphism that is also a lattice isomorphism.
Let A be a non-unital C^*-algebra. There is a unique (up to isomorphism) unital C^*-algebra which contains A as an essential ideal and is maximal in the sense that any other ...
A problem which is both NP (verifiable in nondeterministic polynomial time) and NP-hard (any NP-problem can be translated into this problem). Examples of NP-hard problems ...
1 ... 114|115|116|117|118|119|120 ... 247 Previous Next

...