subalgebra


Also found in: Wikipedia.

subalgebra

[¦səb′al·jə·brə]
(mathematics)
A subset of an algebra which itself forms an algebra relative to the same operations.
A subalgebra (of sets) is any algebra (of sets) contained in some given algebra.
References in periodicals archive ?
every SVV algebra has a distinguished idempotent subalgebra isomorphic to a KLR algebra.
A non-empty subset S of a BCK/BCI-algebra X is called a subalgebra (see [2, 6]) of X if x * y [member of] S for all x, y [member of] S.
When N is a subgroup of a group G then kN can be considered as a left coideal subalgebra of the Hopf algebra kG.
This subalgebra of the pro-V semigroup over X is countable and thus, as said above, amenable to algorithmic treatment.
It is convenient to define 2-parameter Abelian subalgebra of [G.
Integrable hierarchies often occur as the evolution equations of the generators of a deformation of a commutative subalgebra inside some Lie algebra g.
If A is a sup-algebra, then a subset M [subset or equal to] A is called a subalgebra of A if M is closed under operations and joins.
A subset A of a BCI/BCK-algebra [X, *, 0) is called a subalgebra of X if x x y [member of] A for all x, y x A.
In 1991, Xi applied the concept of fuzzy set in BCK-algebras and defined fuzzy subalgebra on BCK-algebras [2].
It is observed that the subalgebra E(S) is an algebraic retract of S, where S is an inverse semigroup iff a and a-1 commute for all aeS.