Examples of using Is isomorphic in English and their translations into Russian
{-}
-
Official
-
Colloquial
the image of a group homomorphism, h(G) is isomorphic to the quotient group G/ker h.
Stone's representation theorem for Boolean algebras states that every Boolean algebra is isomorphic to a field of sets.
If(G,∗) is a locally finite group that is isomorphic to(H,⊙{\displaystyle\odot}), then(H,⊙{\displaystyle\odot}) is also locally finite.
A skew-symmetric graph is a graph that is isomorphic to its own transpose graph, via a special kind of
By definition the representations are realized on L2 sections of line bundles on G/ B S 2,{\displaystyle G/B=\mathbb{S}^{2},} which is isomorphic to the Riemann sphere.
Therefore, any finite modification of this type results in a graph that is isomorphic to the Rado graph.
If A has index r(meaning that A is isomorphic to the matrix algebra Mn/r(D) for a division algebra D of degree r over k), then the k-rank of G is(n/r)- 1.
The inner automorphism group is isomorphic to A 4{\displaystyle A_{4}},
Equivalently, its fundamental group has a subgroup of finite index in its center that is isomorphic to the integers.
Let G be a split reductive group over a field k, and let T be a split maximal torus in G; so T is isomorphic to(Gm)n for some n, with n called the rank of
Every finitely generated module M over a principal ideal domain R is isomorphic to one of the form⨁ i R/( q i){\displaystyle\bigoplus_{ i}
the endomorphism ring of G. For example, the endomorphism ring of the abelian group consisting of the direct sum of m copies of Z/nZ is isomorphic to the ring of m-by-m matrices with entries in Z/nZ.
sufficient conditions under which an arbitrary automaton is isomorphic to a universal planar automaton
then the circle packing whose tangency graph is isomorphic to G is unique,
A torsor for an affine group scheme G over a field k means an affine scheme X over k with an action of G such that X k¯{\displaystyle X_{\overline{k}}} is isomorphic to G k¯{\displaystyle G_{\overline{k}}}
at least one of the subgraphs induced by one of the partition sets is isomorphic to the whole Rado graph.
which asks whether G is isomorphic to H: the answer to the graph isomorphism problem is true if and only if G
their intersection graph is isomorphic to H. However,
whose contacts graph is isomorphic to G. If S is closed(compact
A){\displaystyle(Z, A)} is isomorphic to the structure sheaf of sections of the exterior product Λ( E){\displaystyle\Lambda(E)} of E{\displaystyle E},