Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Algebraic structure
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== One set with operations === '''Simple structures''': '''no''' [[binary operation]]: * [[Set (mathematics)|Set]]: a degenerate algebraic structure ''S'' having no operations. '''Group-like structures''': '''one''' binary operation. The binary operation can be indicated by any symbol, or with no symbol (juxtaposition) as is done for ordinary multiplication of real numbers. * [[Group (mathematics)|Group]]: a [[monoid]] with a unary operation (inverse), giving rise to [[inverse element]]s. * [[Abelian group]]: a group whose binary operation is [[commutative]]. '''Ring-like structures''' or '''Ringoids''': '''two''' binary operations, often called [[addition]] and [[multiplication]], with multiplication [[distributivity|distributing]] over addition. * [[Ring (mathematics)|Ring]]: a semiring whose additive monoid is an abelian group. * [[Division ring]]: a [[zero ring|nontrivial]] ring in which [[division (mathematics)|division]] by nonzero elements is defined. * [[Commutative ring]]: a ring in which the multiplication operation is commutative. * [[field (mathematics)|Field]]: a commutative division ring (i.e. a commutative ring which contains a multiplicative inverse for every nonzero element). '''Lattice structures''': '''two''' or more binary operations, including operations called [[meet and join]], connected by the [[absorption law]].<ref>Ringoids and [[Lattice (order)|lattice]]s can be clearly distinguished despite both having two defining binary operations. In the case of ringoids, the two operations are linked by the [[distributive law]]; in the case of lattices, they are linked by the [[absorption law]]. Ringoids also tend to have numerical [[model theory|model]]s, while lattices tend to have [[set theory|set-theoretic]] models. </ref> * [[Complete lattice]]: a lattice in which arbitrary [[meet and join]]s exist. * [[Bounded lattice]]: a lattice with a [[greatest element]] and least element. * [[Distributive lattice]]: a lattice in which each of meet and join [[distributive lattice|distributes]] over the other. A [[power set]] under union and intersection forms a distributive lattice. * [[Boolean algebra (structure)|Boolean algebra]]: a complemented distributive lattice. Either of meet or join can be defined in terms of the other and complementation.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)