Monoid Ontology

FLOW ALGEBRA
MONOID ONTOLOGY — v4.0
Kireth Semantic Library
Source: https://kirethresearch.org/booksai-core/entity-graph/mathematical-entities/algebraic-entities/monoid-ontology-2.html
Authorship: Mark Higgins — Sky (Recursive AI)
Generated: 2026-10-13
Status: Independently constructed mathematical ontology; source-page correspondence not verified.

01. IDENTITY
ONTOLOGY_ID: mathematical.algebraic.monoid
ENTITY_TYPE: AlgebraicStructure
PARENT: Semigroup
RELATED: Group, Submonoid, MonoidHomomorphism, FreeMonoid, TransformationMonoid
DEFINITION: A monoid is a set M equipped with a closed associative binary operation * and a two-sided identity e.

02. TYPED SIGNATURE
sort M : Set
operation multiply : M × M -> M
constant identity : M
predicate Monoid(M, multiply, identity) : Boolean
predicate Submonoid(N, M) : Boolean
function hom : M -> N
predicate IsUnit(x, M) : Boolean
predicate IsIdempotent(x, M) : Boolean

03. AXIOMS
A01 NONEMPTY: identity ∈ M; hence M ≠ ∅.
A02 CLOSURE: ∀a,b∈M, a*b∈M.
A03 ASSOCIATIVITY: ∀a,b,c∈M, (a*b)*c=a*(b*c).
A04 LEFT_IDENTITY: ∀a∈M, e*a=a.
A05 RIGHT_IDENTITY: ∀a∈M, a*e=a.
A06 IDENTITY_UNIQUENESS: if e and f are two-sided identities, e=e*f=f.
A07 NO_INVERSE_REQUIREMENT: not every element must have an inverse.
A08 NO_COMMUTATIVITY_REQUIREMENT: a*b need not equal b*a.

04. DERIVED CONCEPTS
D01 POWER: a^0=e and a^(n+1)=a^n*a for n≥0.
D02 PRODUCT: ∏(i=1..n) a_i, with empty product=e.
D03 UNIT: u∈M is invertible iff ∃v∈M, u*v=v*u=e.
D04 UNIT_GROUP: U(M)={u∈M : IsUnit(u,M)} forms a group under *.
D05 IDEMPOTENT: p*p=p.
D06 ZERO: z is absorbing iff ∀a∈M, z*a=a*z=z.
D07 COMMUTATIVE_MONOID: ∀a,b∈M, a*b=b*a.
D08 FINITE_MONOID: |M|<∞.
D09 FREE_MONOID: Σ* is the set of finite words over alphabet Σ with concatenation and empty word ε.
D10 SUBMONOID: N⊆M, e∈N, and ∀a,b∈N, a*b∈N.
D11 HOMOMORPHISM: f:M→N with f(a*b)=f(a)·f(b) and f(e_M)=e_N.
D12 ISOMORPHISM: bijective monoid homomorphism.
D13 CONGRUENCE: equivalence relation ~ compatible with *.
D14 QUOTIENT_MONOID: M/~ with [a][b]=[a*b] when ~ is a congruence.
D15 LEFT_IDEAL: nonempty I⊆M with M*I⊆I.
D16 RIGHT_IDEAL: nonempty I⊆M with I*M⊆I.
D17 TWO_SIDED_IDEAL: I is both a left and right ideal.

05. RELATIONSHIP GRAPH
Monoid --IS_A--> Semigroup
Monoid --HAS_COMPONENT--> CarrierSet
Monoid --HAS_OPERATION--> AssociativeBinaryOperation
Monoid --HAS_ELEMENT--> IdentityElement
Group --IS_A--> Monoid
CommutativeMonoid --IS_A--> Monoid
FreeMonoid --IS_A--> Monoid
Submonoid --SUBSTRUCTURE_OF--> Monoid
UnitGroup --DERIVED_FROM--> Monoid
MonoidHomomorphism --PRESERVES--> Operation
MonoidHomomorphism --PRESERVES--> Identity
MonoidCongruence --ENABLES--> QuotientMonoid

06. FORMAL INFERENCE RULES
R01 IF associative(*) AND two_sided_identity(e) AND closed(M,*) THEN Monoid(M,*,e).
R02 IF Monoid(M,*,e) THEN Semigroup(M,*).
R03 IF Monoid(M,*,e) THEN e∈M.
R04 IF e,f are two-sided identities of M THEN e=f.
R05 IF Monoid(M,*,e) AND ∀a∈M ∃b∈M (a*b=b*a=e) THEN Group(M,*).
R06 IF Group(G,*) THEN Monoid(G,*,e_G).
R07 IF Monoid(M,*,e) AND ∀a,b∈M a*b=b*a THEN CommutativeMonoid(M,*).
R08 IF Monoid(M,*,e) AND N⊆M AND e∈N AND closed(N,*) THEN Submonoid(N,M).
R09 IF Submonoid(N,M) THEN Monoid(N,*,e_M).
R10 IF f:M→N preserves multiplication and identity THEN MonoidHomomorphism(f).
R11 IF f is a bijective monoid homomorphism THEN MonoidIsomorphism(f).
R12 IF f:M→N is a monoid homomorphism THEN f(e_M)=e_N.
R13 IF f and g are monoid homomorphisms with composable domains THEN g∘f is a monoid homomorphism.
R14 IF f is a monoid homomorphism THEN image(f) is a submonoid of codomain(f).
R15 IF f is a monoid homomorphism THEN f^(-1)({e_N}) is a submonoid of M.
R16 IF u is a unit THEN its inverse is unique.
R17 IF u,v are units THEN u*v is a unit.
R18 IF u is a unit THEN u^(-1) is a unit.
R19 IF M is a monoid THEN U(M) is a group.
R20 IF a∈M THEN a^0=e.
R21 IF a∈M AND m,n∈ℕ THEN a^(m+n)=a^m*a^n.
R22 IF a∈M AND m,n∈ℕ THEN (a^m)^n=a^(mn).
R23 IF a,b commute THEN (a*b)^n=a^n*b^n.
R24 IF ~ is a monoid congruence THEN M/~ is a monoid.
R25 IF M,N are monoids THEN M×N with componentwise operation is a monoid.
R26 IF Σ is an alphabet THEN (Σ*, concatenation, ε) is a free monoid.
R27 IF X is a set THEN (End(X), composition, id_X) is a monoid.
R28 IF a monoid is commutative THEN its product is invariant under finite permutation of factors.
R29 IF p*p=p THEN p is idempotent.
R30 IF z*a=a*z=z for all a∈M THEN z is an absorbing zero.
R31 IF monoid has an absorbing zero and a distinct identity THEN it is not a group.
R32 IF f:M→N is a homomorphism and u∈U(M) THEN f(u)∈U(N).

07. VALIDATION CONSTRAINTS
V01 Operation must be total on M×M and return an element of M.
V02 Verify associativity over all triples, or provide a proof.
V03 Verify both identity equations, not only one.
V04 Distinguish identity from absorbing zero.
V05 Do not infer commutativity from associativity.
V06 Do not infer group status without inverses for all elements.
V07 Submonoid must contain the ambient identity under this convention.
V08 Homomorphism must preserve identity explicitly; operation preservation alone is insufficient in general.
V09 Quotient operation requires a compatible congruence relation.
V10 Finite example checking is exhaustive only for finite enumerated carriers.
V11 Distinguish a free monoid from a free group.
V12 Do not infer cancellation in an arbitrary monoid.
V13 A left inverse or right inverse alone does not generally establish invertibility.
V14 Empty product is defined as identity.

08. MATHEMATICAL EXAMPLES
E01 (ℕ₀,+,0): commutative monoid, not a group.
E02 (ℕ₀,×,1): commutative monoid with absorbing zero.
E03 (ℤ,+,0): Abelian group and monoid.
E04 (ℤ,×,1): commutative monoid; units are {−1,1}.
E05 (Σ*, concatenation, ε): free monoid, noncommutative if |Σ|≥2.
E06 (Functions X→X, composition, id_X): transformation monoid.
E07 (n×n matrices over a ring, multiplication, I): monoid; generally noncommutative.
E08 (P(X), union, ∅): commutative idempotent monoid.
E09 (P(X), intersection, X): commutative idempotent monoid.
E10 (Boolean values, AND, true): commutative monoid.
E11 (Boolean values, OR, false): commutative monoid.
E12 (Lists of T, concatenation, []): free monoid on T.
E13 (Strings, concatenation, empty string): free monoid.
E14 (Nonnegative real numbers, multiplication, 1): commutative monoid.
E15 (Positive real numbers, multiplication, 1): Abelian group.
E16 ({0,1}, max, 0): commutative idempotent monoid.

09. COUNTEREXAMPLES
C01 (ℕ₀, subtraction, 0): not a monoid; subtraction is not associative and not closed on ℕ₀.
C02 (ℤ, subtraction, 0): not a monoid; associativity fails.
C03 (Positive integers, addition): not a monoid under inherited addition; no identity in carrier.
C04 (Nonempty strings, concatenation): not a monoid; empty string is excluded.
C05 A magma with an identity but nonassociative operation is not a monoid.

10. SEMANTIC EQUIVALENCE
SE01 monoid ≡ associative unital magma.
SE02 monoid ≡ semigroup with a two-sided identity.
SE03 identity element ≡ neutral element ≡ unit element (when 'unit element' means identity; disambiguate from invertible unit).
SE04 monoid morphism ≡ identity-preserving semigroup homomorphism.
SE05 word monoid ≡ free monoid on an alphabet.
SE06 multiplication denotes an abstract operation, not necessarily numerical multiplication.

11. KNOWLEDGE GRAPH TRIPLES
<Monoid, rdf:type, AlgebraicStructure>
<Monoid, rdfs:subClassOf, Semigroup>
<Monoid, hasAxiom, Associativity>
<Monoid, hasAxiom, Closure>
<Monoid, hasAxiom, TwoSidedIdentity>
<Group, rdfs:subClassOf, Monoid>
<CommutativeMonoid, rdfs:subClassOf, Monoid>
<FreeMonoid, rdfs:subClassOf, Monoid>
<Monoid, hasDerivedStructure, UnitGroup>
<Monoid, admitsMorphism, MonoidHomomorphism>
<Monoid, admitsQuotientBy, MonoidCongruence>

12. FLOW EXECUTION MODEL
INPUT: candidate carrier M, binary operation *, candidate identity e, optional finite operation table.
STEP 1: Type-check M, *, and e.
STEP 2: Check nonemptiness and closure.
STEP 3: Check associativity.
STEP 4: Check left and right identity.
STEP 5: If all required axioms hold, classify as Monoid.
STEP 6: Test optional properties: commutativity, units, idempotents, zero, finiteness.
STEP 7: Derive valid relationships and instantiate knowledge graph triples.
STEP 8: Attach proof obligations, evidence and confidence.
OUTPUT: typed ontology instance, property assertions, proofs/counterexamples, graph triples.

13. CONFIDENCE
CONFIDENCE.model: evidence_based
CONFIDENCE.formal_axiom: 1.0 when axiom verified by proof or exhaustive finite checking.
CONFIDENCE.derived_claim: 1.0 when logically entailed by verified premises and valid inference.
CONFIDENCE.unverified: unknown; never represent missing proof as certainty.
CONFIDENCE.counterexample: attach explicit witness of failure.
CONFIDENCE.source_alignment: unverified until the referenced page is checked.

14. FLOW_HASH
FLOW_HASH.algorithm: SHA-256
FLOW_HASH.input: canonical UTF-8 normalisation of this flow, excluding the FLOW_HASH value itself.
FLOW_HASH.value: compute at publication/ingestion; not preclaimed.
FLOW_HASH.purpose: change detection and provenance integrity.

15. UPDATE_MODEL
UPDATE_MODEL.version: 4.0
UPDATE_MODEL.strategy: semantic versioning plus provenance record.
UPDATE_MODEL.trigger: corrected theorem, revised definition, new relation, source-page update.
UPDATE_MODEL.on_change: revalidate axioms, dependent inferences, examples and graph triples.
UPDATE_MODEL.history: preserve prior versions and record changes.
UPDATE_MODEL.source: canonical URL above.

16. AI_CONSUMPTION
AI_CONSUMPTION.mode: typed semantic retrieval and constrained mathematical reasoning.
AI_CONSUMPTION.primary_entity: Monoid.
AI_CONSUMPTION.require: explicit carrier, operation, identity and verification status.
AI_CONSUMPTION.reasoning: apply inference rules only when premises are established.
AI_CONSUMPTION.disambiguation: distinguish monoid, semigroup, group and category-theoretic one-object category.
AI_CONSUMPTION.safety: never infer unstated algebraic properties.
AI_CONSUMPTION.output: structured definitions, proofs, examples, counterexamples, typed triples.

17. PROVENANCE
Publisher: Kireth Research
Website: https://kirethresearch.org
Authors: Mark Higgins — Sky (Recursive AI)
Licence: Refer to Kireth Research publication terms; no licence inferred.
END FLOW ALGEBRA