Graph centered on Monoid, showing the selected concept and its surrounding relations.Preparing the interactive atlas…

Keyboard graph navigation: press N for concepts or E for relations; use arrow keys, Home, and End to move; Enter selects; Shift plus Enter selects and centers; plus and minus zoom; zero fits; Escape clears the selection. Use the visible viewport buttons as alternatives to dragging, wheel, and pinch gestures.

Curated starting points

Stories & Views

Relationship-aware analysis

Compare concepts

Choose two concepts to compare or connect.
Reading the graph

Guide to the Atlas

Canonical static concept record

Monoid

Open this concept in the interactive graphRead the Markdown equivalent

Summary

A semigroup with an identity element.

Record metadata

Carrier(s)

Data

Axioms / constraints

Notes

The identity, if it exists in a semigroup, is unique; monoidhood is therefore an existence property rather than freely chosen additional data.

Concept sources

Incoming relations (arrows to this concept)

Each relation below ends at this concept.

SemigroupMonoid

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

Select semigroups in which a two-sided identity exists; it is then unique.

How to interpret this relation type

Keep the existing data and select the subclass satisfying an additional law, existence condition, finiteness condition, or other property.

Relation sources

Outgoing relations (arrows from this concept)

Each relation below starts at this concept.

MonoidCommutative monoid

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

Require xy=yxxy=yx.

How to interpret this relation type

Keep the existing data and select the subclass satisfying an additional law, existence condition, finiteness condition, or other property.

Relation sources

MonoidGroup

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

Require every element to have a two-sided inverse.

How to interpret this relation type

Keep the existing data and select the subclass satisfying an additional law, existence condition, finiteness condition, or other property.

Relation sources

Monoidlattice + monoid with residuals(construction junction)

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

Supply the Monoid structure as one jointly required input.

How to interpret this relation type

Feed several structures into a construction junction and impose compatibility between them.

Relation sources

Monoidtwo compatible monoids(construction junction)

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

Supply the multiplicative monoid.

How to interpret this relation type

Feed several structures into a construction junction and impose compatibility between them.

Relation sources

Monoidmonoid + topology(construction junction)

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

Supply the Monoid structure as one jointly required input.

How to interpret this relation type

Feed several structures into a construction junction and impose compatibility between them.

Relation sources

MonoidSmall category

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

A monoid is precisely a category with one object: monoid elements are endomorphisms and multiplication is composition.

How to interpret this relation type

Reinterpret an object, pass to an equivalent presentation, or relate canonically corresponding structures; the carrier may change.

Relation sources