q2K BHP
Black History Portal
THE BHP WIRE —
HIDDEN TRUTHS
What's New!
THE JOURNEY THROUGH TIME

Explore Black History

Explore the people, places, events, achievements, struggles and stories that shaped our journey.

✊🏾

Civil Rights

Movements, leaders, victories and the continuing fight for equality.

⚙️

Black Inventors

Innovation, patents, science, technology and world-changing contributions.

🏆

Sports

Pioneers, champions, Negro Leagues, records, activism and excellence.

♟️

People

Meet the people whose lives, choices and achievements shaped the journey.

📍

Places

Black towns, communities, institutions and places where history happened.

📜

Events

Moments that changed communities, movements, institutions and the nation.

Enter a person, place, event, or topic.
MY'STORY

The MOVE Fire

This is a personal recollection on the Move fire on May 13, 1985 Philadelphia police fired thousands of rounds at the MOVE house, city officials approved dropping an explosive device on the roof, the resulting fire was allowed to burn, 11 people—including five children—died, and 61 homes were destroyed. Philadelphia City Council later called it a “brutal attack carried out by the City of Philadelphia on its own citizens” and acknowledged that no individual faced criminal consequences for the bombing. One timeline correction worth preserving for the BHP record: the major previous MOVE-police confrontation was August 8, 1978, about seven years before the bombing, not a year or two earlier. Officer James Ramp was killed, other police and firefighters were wounded, nine MOVE members were later convicted, and television cameras recorded police beating Delbert Africa during his arrest. The 1985 MOVE Commission later specifically criticized city planners for failing to adequately use lessons from that 1978 confrontation. And that actually strengthens the point you’re making: 1985 did not happen without precedent or institutional memory. There had already been a deadly confrontation with MOVE, years of conflict, negotiations and police involvement before Osage Avenue.

MORE →
BLACK FACTS
The Truths They Never Taught You...

Wilmington 1898 — An American Coup

Wilmington, North Carolina once had a thriving Black middle class and an elected interracial government. In 1898 white supremacists used violence to overthrow that government, kill Black residents and drive many others from the city.

MORE →
BHP gathered finds from its connected research sources. Showing the 4 strongest Black History matches.
← BACK TO RESULTS
Wikipedia

Outline of algebraic structures

In mathematics, many types of algebraic structures are studied. Abstract algebra is primarily the study of specific algebraic structures and their properties. Algebraic structures may be viewed in different ways, however the common starting point of algebra texts is that an algebraic object incorporates one or more sets with one or more binary operations or unary operations satisfying a collection of axioms.

Another branch of mathematics known as universal algebra studies algebraic structures in general. From the universal algebra viewpoint, most structures can be divided into varieties and quasivarieties depending on the axioms used. Some axiomatic formal systems that are neither varieties nor quasivarieties, called nonvarieties, are sometimes included among the algebraic structures by tradition.

Concrete examples of each structure will be found in the articles listed.

Algebraic structures are so numerous today that this article will inevitably be incomplete. In addition to this, there are sometimes multiple names for the same structure, and sometimes one name will be defined by disagreeing axioms by different authors. Most structures appearing on this page will be common ones which most authors agree on. Other web lists of algebraic structures, organized more or less alphabetically, include Jipsen and PlanetMath Archived 2007-11-13 at the Wayback Machine. These lists mention many structures not included below, and may present more information about some structures than is presented here.

Study of algebraic structures

[edit]

Algebraic structures appear in most branches of mathematics, and one can encounter them in many different ways.

  • Beginning study: In American universities, groups, vector spaces and fields are generally the first structures encountered in subjects such as linear algebra. They are usually introduced as sets with certain axioms.
  • Advanced study:
    • Abstract algebra studies properties of specific algebraic structures.
    • Universal algebra studies algebraic structures abstractly, rather than specific types of structures.
    • Category theory studies interrelationships between different structures, algebraic and non-algebraic. To study a non-algebraic object, it is often useful to use category theory to relate the object to an algebraic structure.

Types of algebraic structures

[edit]

In full generality, an algebraic structure may use any number of sets and any number of axioms in its definition. The most commonly studied structures, however, usually involve only one or two sets and one or two binary operations. The structures below are organized by how many sets are involved, and how many binary operations are used. Increased indentation is meant to indicate a more exotic structure, and the least indented levels are the most basic.

One set with no binary operations

[edit]
  • Set: a degenerate algebraic structure S having no operations.
  • Pointed set: S has one or more distinguished elements, often 0, 1, or both.
  • Unary system: S and a single unary operation over S.
  • Pointed unary system: a unary system with S a pointed set.

One binary operation on one set

[edit]
Group-like structures
Total Associative Identity Divisible
Partial magma Unneeded Unneeded Unneeded Unneeded
Multiplicative Unneeded Unneeded Required Unneeded
Semigroupoid Unneeded Required Unneeded Unneeded
Small category Unneeded Required Required Unneeded
Groupoid Unneeded Required Required Required
Magma Required Unneeded Unneeded Unneeded
Quasigroup Required Unneeded Unneeded Required
Unital magma Required Unneeded Required Unneeded
Loop Required Unneeded Required Required
Semigroup Required Required Unneeded Unneeded
Associative quasigroup Required Required Unneeded Required
Monoid Required Required Required Unneeded
Group Required Required Required Required

The following group-like structures consist of a set with a binary operation. The binary operation can be indicated by any symbol, or with no symbol (juxtaposition). The most common structure is that of a group. Other structures involve weakening or strengthening the axioms for groups, and may additionally use unary operations.

Two binary operations on one set

[edit]

The main types of structures with one set having two binary operations are ring-like or ringoids and lattice-like or simply lattices. Ringoids and lattices 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 models, while lattices tend to have set-theoretic models.

In ring-like structures or ringoids, the two binary operations are often called addition and multiplication, with multiplication linked to addition by the distributive law.

  • Semiring: a ringoid such that S is a monoid under each operation. Addition is typically assumed to be commutative and associative, and the monoid product is assumed to distribute over the addition on both sides, and the additive identity 0 is an absorbing element in the sense that 0 x = 0 for all x.
  • Near-ring: a semiring whose additive monoid is a (not necessarily abelian) group.
  • Ring: a semiring whose additive monoid is an abelian group.
    • Commutative ring: a ring in which the multiplication operation is commutative.
    • Division ring: a nontrivial ring in which division by nonzero elements is defined.
    • Integral domain: A nontrivial commutative ring in which the product of any two nonzero elements is nonzero.
    • Field: a commutative division ring (i.e. a commutative ring which contains a multiplicative inverse for every nonzero element).
  • Nonassociative rings: These are like rings, but the multiplication operation need not be associative.
  • Boolean ring: a commutative ring with idempotent multiplication operation.
  • Kleene algebras: a semiring with idempotent addition and a unary operation, the Kleene star, satisfying additional properties.
  • *-algebra or *-ring: a ring with an additional unary operation (*) known as an involution, satisfying additional properties.
  • Arithmetic: addition and multiplication on an infinite set, with an additional pointed unary structure. The unary operation is injective successor, and has distinguished element 0.
    • Robinson arithmetic. Addition and multiplication are recursively defined by means of successor. 0 is the identity element for addition, and annihilates multiplication. Robinson arithmetic is listed here even though it is a variety, because of its closeness to Peano arithmetic.
    • Peano arithmetic. Robinson arithmetic with an axiom schema of induction. Most ring and field axioms bearing on the properties of addition and multiplication are theorems of Peano arithmetic or of proper extensions thereof.

Lattice-like structures have two binary operations called meet and join, connected by the absorption law.

  • Latticoid: meet and join commute but need not associate.
  • Skew lattice: meet and join associate but need not commute.
  • Lattice: meet and join associate and commute.
    • Complete lattice: a lattice in which arbitrary meet and joins exist.
    • Bounded lattice: a lattice with a greatest element and least element.
    • Complemented lattice: a bounded lattice with a unary operation, complementation, denoted by postfix ⊥. The join of an element with its complement is the greatest element, and the meet of the two elements is the least element.
    • Modular lattice: a lattice whose elements satisfy the additional modular identity.
    • Distributive lattice: a lattice in which each of meet and join distributes over the other. Distributive lattices are modular, but the converse does not hold.
    • Boolean algebra: a complemented distributive lattice. Either of meet or join can be defined in terms of the other and complementation. This can be shown to be equivalent with the ring-like structure of the same name above.
    • Heyting algebra: a bounded distributive lattice with an added binary operation, relative pseudo-complement, denoted by the infix operator →, and governed by the axioms:
      • x → x = 1
      • x (x → y) = x y
      • y (x → y) = y
      • x → (y z) = (x → y) (x → z)

Module-like structures on two sets

[edit]

The following module-like structures have the common feature of having two sets, A and B, so that there is a binary operation from A×A into A and another operation from A×B into A. Modules, counting the ring operations, have at least three binary operations.

Algebra-like structures on two sets

[edit]

These structures are defined over two sets, a ring R and an R-module M equipped with an operation called multiplication. This can be viewed as a system with five binary operations: two operations on R, two on M and one involving both R and M. Many of these structures are hybrid structures of the previously mentioned ones.

Algebraic structures with additional non-algebraic structure

[edit]

There are many examples of mathematical structures where algebraic structure exists alongside non-algebraic structure.

Algebraic structures in different disciplines

[edit]

Some algebraic structures find uses in disciplines outside of abstract algebra. The following is meant to demonstrate some specific applications in other fields.

In physics:

In mathematical logic:

In computer science:

See also

[edit]

References

[edit]
  1. ^ Jonathan D. H. Smith (15 November 2006). An Introduction to Quasigroups and Their Representations. Chapman & Hall. ISBN 9781420010633. Retrieved 2012-08-02.
  • Garrett Birkhoff, 1967. Lattice Theory, 3rd ed, AMS Colloquium Publications Vol. 25. American Mathematical Society.
  • ———, and Saunders MacLane, 1999 (1967). Algebra, 2nd ed. New York: Chelsea.
  • George Boolos and Richard Jeffrey, 1980. Computability and Logic, 2nd ed. Cambridge Univ. Press.
  • Dummit, David S., and Foote, Richard M., 2004. Abstract Algebra, 3rd ed. John Wiley and Sons.
  • Grätzer, George, 1978. Universal Algebra, 2nd ed. Springer.
  • David K. Lewis, 1991. Part of Classes. Blackwell.
  • Michel, Anthony N., and Herget, Charles J., 1993 (1981). Applied Algebra and Functional Analysis. Dover.
  • Potter, Michael, 2004. Set Theory and its Philosophy, 2nd ed. Oxford Univ. Press.
  • Smorynski, Craig, 1991. Logical Number Theory I. Springer-Verlag.

A monograph available free online:

[edit]

Source: Wikipedia. Article content is retrieved live through the MediaWiki API.

No preview image
Wikipedia

Outline of algebraic structures

In mathematics, many types of algebraic structures are studied. Abstract algebra is primarily the study of specific algebraic structures and their properties. Algebraic structures may be viewed in different ways, however the common starting point of algebra texts is that an algebraic object incorporates one or more sets with one or more binary operations or unary operations satisfying a collection of axioms. Another branch of mathematics known as universal algebra studies algebraic structures in general. From the universal algebra viewpoint, most structures can be divided into varieties and quasivarieties depending on the axioms used. Some axiomatic formal systems that are neither varieties nor quasivarieties, called nonvarieties, are sometimes included among the algebraic structures by tradition. Concrete examples of each structure will be found in the articles listed. Algebraic structures are so numerous today that this article will inevitably be incomplete. In addition to this, there are sometimes multiple names for the same structure, and sometimes one name will be defined by disagreeing axioms by different authors. Most structures appearing on this page will be common ones which most authors agree on. Other web lists of algebraic structures, organized more or less alphabetically, include Jipsen and PlanetMath Archived 2007-11-13 at the Wayback Machine. These lists mention many structures not included below, and may present more information about some structures than is presented here.

MORE →
No preview image
Wikipedia

Nonabelian algebraic topology

In mathematics, nonabelian algebraic topology studies an aspect of algebraic topology that involves (inevitably noncommutative) higher-dimensional algebras. Many of the higher-dimensional algebraic structures are noncommutative and, therefore, their study is a very significant part of nonabelian category theory, and also of Nonabelian Algebraic Topology (NAAT), which generalises to higher dimensions ideas coming from the fundamental group. Such algebraic structures in dimensions greater than 1 develop the nonabelian character of the fundamental group, and they are in a precise sense ‘more nonabelian than the groups'. These noncommutative, or more specifically, nonabelian structures reflect more accurately the geometrical complications of higher dimensions than the known homology and homotopy groups commonly encountered in classical algebraic topology. An important part of nonabelian algebraic topology is concerned with the properties and applications of homotopy groupoids and filtered spaces. Noncommutative double groupoids and double algebroids are only the first examples of such higher-dimensional structures that are nonabelian. The new methods of Nonabelian Algebraic Topology (NAAT) "can be applied to determine homotopy invariants of spaces, and homotopy classification of maps, in cases which include some classical results, and allow results not available by classical methods". Cubical omega-groupoids, higher homotopy groupoids, crossed modules, crossed complexes and Galois groupoids are key concepts in developing applications related to homotopy of filtered spaces, higher-dimensional space structures, the construction of the fundamental groupoid of a topos E in the general theory of topoi, and also in their physical applications in nonabelian quantum theories, and recent developments in quantum gravity, as well as categorical and topological dynamics. Further examples of such applications include the generalisations of noncommutative geometry formalizations of the noncommutative standard models via fundamental double groupoids and spacetime structures even more general than topoi or the lower-dimensional noncommutative spacetimes encountered in several topological quantum field theories and noncommutative geometry theories of quantum gravity. A fundamental result in NAAT is the generalised, higher homotopy van Kampen theorem proven by R. Brown, which states that "the homotopy type of a topological space can be computed by a suitable colimit or homotopy colimit over homotopy types of its pieces''. A related example is that of van Kampen theorems for categories of covering morphisms in lextensive categories. Other reports of generalisations of the van Kampen theorem include statements for 2-categories and a topos of topoi [1] Archived 2005-07-20 at the Wayback Machine. Important results in higher-dimensional algebra are also the extensions of the Galois theory in categories and variable categories, or indexed/'parametrized' categories. The Joyal–Tierney representation theorem for topoi is also a generalisation of the Galois theory. Thus, indexing by bicategories in the sense of Benabou one also includes here the Joyal–Tierney theory.

MORE →
Wikipedia

Data structure

In computer science, a data structure is a way to organize and store data that is usually chosen for efficient access to data. More precisely, a data structure is the physical implementation of a data type, including specifications of the data organization and storage format, as well as functions or operations for working with this data. Data structures are closely related to abstract data types (ADTs). The data structure describes the representation of data in memory and how operations are carried out, while the ADT describes the logical form or algebraic structure of the data type—what operations are allowed and what results they produce—without describing how those operations are implemented. Some authors do not use the term "abstract data type" and simply refer to the logical and physical forms of the data structure.

MORE →
Wikipedia

Elementary algebra

Elementary algebra, also known as high school algebra or college algebra, encompasses the basic concepts of algebra. It is often contrasted with arithmetic: arithmetic deals with specified numbers, whilst algebra introduces numerical variables (quantities without fixed values). In arithmetic, operations (such as addition and subtraction) can only be performed on numbers. In algebra, operations can be performed on numbers, variables, and terms. Unlike abstract algebra, elementary algebra is not concerned with algebraic structures outside the realm of real and complex numbers. It is typically taught to secondary school students and at introductory college level in the United States, and builds on their understanding of arithmetic. The use of variables to denote quantities allows general relationships between quantities to be formally and concisely expressed, and thus enables solving a broader scope of problems. Many quantitative relationships in science and mathematics are expressed as algebraic equations.

MORE →
TOPIC OF THE DAY

Greenwood / Black Wall Street

Before the 1921 destruction of Tulsa’s Greenwood District, Black residents had created a remarkable center of business and community life. The district included stores, professional offices, entertainment venues and homes owned by Black citizens. Understanding Greenwood means learning what was built—not only what was burned.

MORE →
TRIVIA QUESTION OF THE DAY

Which heavyweight champion was known as the “Brown Bomber”?

Joe Louis.