Orientation & notation
How to use this reference, the notation conventions, the P-/RD-code legend, and the concept→problem index that ties every idea back to the materials-R&D problems.
This is a from-scratch mathematics reference for the categorical and algebraic formalization of industrial-materials R&D. It assumes you are comfortable with mathematical notation and undergraduate linear algebra, but not that you know abstract algebra or category theory. Every construction here earns its place by answering a concrete question about formulating, processing, and reasoning about paint and other “dirty” materials — so each idea is tagged with the problem (P#) and research direction (RD#) it serves.
You do not have to read it linearly. Skim this front door, then jump straight to the module you need via the concept index below.
How to use this reference
This reference is one of a set of companion documents. Read it alongside the others depending on what you need:
- The synthesis (
algebra-ch0_formalizing-materials-RnD_synthesis.md) states the thesis: that materials R&D is best modelled with categories and algebra. It is the why. This reference is the how — the self-contained math that lets you read the synthesis in full and act on its research directions. - The materials reference (a parallel modular site) teaches the domain — phases, dispersions, microstructure, rheology, colour — in an engineer’s language. When a construction here points at a paint phenomenon, that reference explains the phenomenon.
- The ARiSE draft is the original problem-and-AI-solution document the whole effort formalizes.
Throughout, small chips tie the math back to the synthesis. A P# chip names one of the thirteen problem characteristics — the first-principles decomposition of what makes materials R&D hard. An RD# chip names one of the eight research directions — the concrete programmes the synthesis proposes. Both legends are spelled out in full below so this reference stands alone. Wherever you see a synthesis callout, it is telling you exactly which P#/RD# the surrounding construction addresses.
One takeaway. Read this page for orientation, use the concept index to navigate, and trust the P#/RD# chips to connect every abstraction to a real R&D problem.
Bridge. This is the math half of the pair. For the materials science it formalizes — what a dispersion is, why microstructure is a hidden state, how colour aliases — start at the materials orientation page, which carries the same P#/RD# legend and a materials↔︎EE/CS Rosetta stone.
Notation & conventions
These conventions hold throughout every module. “Unique up to (unique) isomorphism” is the standard sense in which universal constructions are unique; treat \(\cong\) (isomorphic) as the working notion of sameness, not literal equality.
| Notation | Meaning |
|---|---|
| \(\mathsf{Set},\ \mathsf{Grp},\ \mathsf{Mon},\ \mathsf{Ring},\ R\text{-}\mathsf{Mod},\ \mathsf{Vect}_k,\ \mathsf{Top}\) | categories, in sans-serif |
| \(A, B, C, X, Y, Z\) | objects; with \(f, g, h\) for morphisms |
| \(\mathrm{id}_A\) (also \(1_A\)) | identity morphism on \(A\) |
| \(g \circ f\) (= \(gf\)) | composition: “apply \(f\) first, then \(g\)” |
| \(\mathrm{Hom}_{\mathsf C}(A,B)\) (also \(\mathsf C(A,B)\)) | the set of morphisms \(A \to B\) in \(\mathsf C\) |
| \(\mathrm{End}(A),\ \mathrm{Aut}(A)\) | endomorphisms; automorphisms of \(A\) |
| \(0\) / \(1\) (or \(\varnothing\) / \(\ast\) in \(\mathsf{Set}\)) | initial / terminal object; a zero object is both at once |
| \(A \times B\) / \(A \sqcup B\) | product / coproduct |
| \(A \oplus B\) | direct sum (biproduct in additive categories) — non-interacting combination |
| \(A \otimes B\), unit \(I\) | tensor / monoidal product — the home of interaction |
| \(\ker,\ \operatorname{im},\ \operatorname{coker}\) | kernel; image; cokernel |
| \(M^\vee = \mathrm{Hom}_R(M, R)\) | dual module |
| \(F, G\) | functors; \(\eta, \varepsilon\) for the unit / counit of an adjunction |
| \(F \dashv G\) | adjunction, with \(F\) the left adjoint |
| juxtaposition; \(e\) or \(1\) | group/monoid operation; its identity element |
| \(\Sigma^*\) | free monoid on the alphabet \(\Sigma\) |
| \(S/\!\sim\) | quotient of \(S\) by an equivalence \(\sim\) |
| \(f^{-1}(y)\) | fiber of \(f\) over \(y\) |
| \(\mathbb{N},\ \mathbb{Z},\ \mathbb{Q},\ \mathbb{R},\ \mathbb{C}\) | the standard number systems |
| \(\wp(S)\) (also \(2^S\)) | powerset of \(S\) |
| \(C(n,k)\) | binomial coefficient, “\(n\) choose \(k\)” |
The problem codes (P1–P13)
The P-codes are the synthesis’s first-principles decomposition of what makes industrial-materials R&D fundamentally hard. Each is a structural feature of the problem, not of any one solution.
| Code | Problem characteristic |
|---|---|
| P1 | Path-dependence / non-commutativity |
| P2 | Composition + irreversibility (→ monoid/category, not group; precisely → premonoidal/effectful category) |
| P3 | Mediation / factorization through hidden intermediate states |
| P4 | Degeneracy (many↔︎one; fibers / quotients / invariants) |
| P5 | Multi-objective interfering constraints (Pareto) |
| P6 | Locality / scope-of-validity + gluing |
| P7 | Transferability / horizontal deployment (functoriality) |
| P8 | Multi-component coupling (tensor / multilinear) |
| P9 | Sensory↔︎physical duality |
| P10 | Knowledge as a structured, composable, verifiable object |
| P11 | Canonical decomposition into irreducible atoms |
| P12 | Quantifiable returns / scaling laws |
| P13 | Invariants & canonical forms |
The research directions (RD1–RD8)
The RD-codes are the synthesis’s eight concrete research directions — each a mathematical programme aimed at one or more of the P-codes above.
| Code | Research direction |
|---|---|
| RD1 | Effectful / premonoidal process-category for dispersed materials with hidden state (performance = functor) |
| RD2 | Trace-monoid recipe algebra + confluent rewriting normal forms |
| RD3 | “Right hidden variable” = universal coimage (sharpening the PSP linkage) |
| RD4 | Transfer-as-functoriality / ologs / functorial data migration for tacit knowledge |
| RD5 | Symmetric-algebra mixture models + \(C(n,k)\) interaction budget |
| RD6 | Sheaves for scope-of-validity + FCA concept lattices |
| RD7 | Degeneracy / robustness via failure-of-UFD / singularity (cf. sloppy models) |
| RD8 | Derived-functor / Ext obstruction theory for irreversibility / emergence |
Concept → problem → module
This is the master index. Find the cluster you care about, note the P#/RD# it serves, and follow the link to the module that develops it. Several clusters span multiple modules — the math is genuinely interconnected.
| Cluster | Key concepts | P# / RD# | Module(s) |
|---|---|---|---|
| Degeneracy & “the right state” | fiber, quotient, canonical decomposition, coimage, complete invariant | P3, P4, P13, RD3 | Sets, orders & lattices, Categories, Rings & modules |
| Trade-offs | poset, lattice, antichain, Pareto, Zorn | P5 | Sets, orders & lattices |
| The duality template | Galois connection, Galois correspondence, FCA | P9, RD6 | Sets, orders & lattices, Fields & Galois, Computation & locality |
| Processes as morphisms | category, monoid vs group, action, first iso theorem | P1, P2, P3 | Categories, Monoids & groups |
| Transfer | functor, adjoint, equivalence, universal property, base change, group objects, ologs, functorial migration | P7, P10, RD4 | Categories, Monoids & groups, Rings & modules, Computation & locality |
| Path-dependence (precise) | non-commutativity, premonoidal/effectful category, string diagrams, trace monoid | P1, P2, RD1, RD2 | Monoids & groups, Monoidal & process, Computation & locality |
| Irreversibility | non-invertibility, quasi-isomorphism, resource theory | P2 | Monoids & groups, Homological algebra, Monoidal & process |
| Hidden state & obstruction | snake lemma \(\delta\), derived functors, Tor/Ext | P3, RD8 | Homological algebra |
| Coupling | tensor product, symmetric/exterior algebra, mixture models | P8, RD5 | Rings & modules |
| Atoms + gluing | irreducible/prime, Jordan–Hölder, extensions, semidirect product | P11 | Monoids & groups |
| Degeneracy diagnostic | failure-of-UFD ↔︎ singularity, sloppy models | P4, RD7 | Rings & modules, The bridge |
| Scope / locality | localization, sheaves, sheaf cohomology (\(H^1\)) | P6, RD6 | Rings & modules, Computation & locality |
| Decision / recipe equivalence | rewriting, confluence, Newman, Knuth–Bendix | RD2 | Computation & locality |
| What algebra can’t do | Pareto, scaling laws | P5, P12 | Sets, orders & lattices, The bridge |
Suggested first path. For the synthesis’s core thesis — processes as morphisms — read Sets, orders & lattices (functions, fibers, quotients, canonical decomposition) → Categories (categories, functors, universal properties) → Monoids & groups (monoid vs group; first isomorphism theorem) → Monoidal & process (monoidal → premonoidal/effectful categories).
Symbol glossary
A compact lookup for symbols used across the modules. The fuller definitions live where each symbol is introduced.
| Symbol | Meaning |
|---|---|
| \(\in,\ \subseteq,\ \subsetneq\) | element of; subset; proper subset |
| \(\wp(S),\ 2^S\) | powerset of \(S\) |
| \(A\times B,\ \prod\) | Cartesian / categorical product |
| \(A\sqcup B,\ \coprod\) | disjoint union / coproduct |
| \(A\oplus B\) | direct sum (biproduct) — non-interacting combination |
| \(A\otimes B,\ I\) | tensor / monoidal product; unit — the home of interaction |
| \(f:X\to Y,\ g\circ f\) | morphism; composition (apply \(f\) then \(g\)) |
| \(\operatorname{im} f,\ f^{-1}(B),\ f^{-1}(y)\) | image; preimage; fiber over \(y\) |
| \(S/\!\sim,\ [x]\) | quotient set; equivalence class |
| \(\mathrm{Hom}_{\mathsf C}(A,B)\) | morphisms \(A\to B\) in \(\mathsf C\) |
| \(\mathrm{id}_A,\ \mathrm{End}(A),\ \mathrm{Aut}(A)\) | identity; endomorphism monoid; automorphism group |
| \(0,\ 1\) (or \(\varnothing,\ \ast\)) | initial; terminal object |
| \(\mathsf C^{\mathrm{op}}\) | opposite category |
| \(F\dashv G,\ \eta,\varepsilon\) | adjunction (\(F\) left adjoint); unit, counit |
| \(\varprojlim,\ \varinjlim\) | limit; colimit |
| \(\le,\ \vee,\ \wedge\) | partial order; join (sup); meet (inf) |
| \(\preceq\) | Pareto dominance (product order) |
| \(e\) or \(1,\ \Sigma^*\) | identity element; free monoid on alphabet \(\Sigma\) |
| \(\ker,\ \operatorname{im},\ \operatorname{coker}\) | kernel; image; cokernel |
| \(G/N,\ N\trianglelefteq G,\ N\rtimes_\theta Q\) | quotient group; normal subgroup; semidirect product |
| \([a,b],\ G^{\mathrm{ab}}\) | commutator; abelianization |
| \(R/I,\ \mathrm{Spec}\,R,\ S^{-1}R\) | quotient ring; prime spectrum; localization |
| \(M^\vee=\mathrm{Hom}_R(M,R)\) | dual module |
| \(S^\bullet,\ \Lambda^k,\ T^\bullet\) | symmetric / exterior / tensor algebra; \(\dim\Lambda^k(R^n)=C(n,k)\) |
| \(K(\mathsf C),\ \chi\) | Grothendieck group; Euler characteristic |
| \(d,\ H_n,\ \mathrm{Tor},\ \mathrm{Ext}\) | differential; homology; derived tensor; derived Hom |
| \(\simeq,\ D(\mathsf A)\) | quasi-isomorphism; derived category |
| \([F:k],\ \mathrm{Gal}(F/k),\ F^G\) | field-extension degree; Galois group; fixed field |
| \(V(I),\ I(S),\ \sqrt I\) | variety of an ideal; ideal of a set; radical |
| \(\delta_F,\ \Sigma_F,\ \Delta_F,\ \Pi_F\) | data-migration functors (pullback \(\Delta\); adjoints \(\Sigma\dashv\Delta\dashv\Pi\)) |
| \(C(n,k)\) | binomial coefficient “\(n\) choose \(k\)” |
Further reading
The full, tiered bibliography lives in The materials bridge; these are the best entry points.
- Gentle on-ramps. B. Fong & D. Spivak, Seven Sketches in Compositionality (CUP 2019; arXiv:1803.05316) — the single best entry point. E. Riehl, Category Theory in Context (Dover 2016). T. Leinster, Basic Category Theory — short and rigorous.
- The Aluffi material (Parts 1–6). P. Aluffi, Algebra: Chapter 0 — the source the synthesis is built against. Dummit & Foote, Abstract Algebra — encyclopedic reference. S. Mac Lane, Categories for the Working Mathematician. Weibel, An Introduction to Homological Algebra.
- Beyond the book (Parts 7–8). B. Coecke & A. Kissinger, Picturing Quantum Processes (CUP 2017) — process theories and string diagrams. Power & Robinson (1997) on premonoidal categories. Baader & Nipkow, Term Rewriting and All That. Spivak & Kent, “Ologs” (PLoS ONE 2012).
- The materials bridge (Part 9). Olson, “Computational Design of Hierarchically Structured Materials” (Science 1997) and Kalidindi, Hierarchical Materials Informatics (2015) — the PSP linkages this whole effort sharpens.
Part of a four-document set: the ARiSE draft (problem + AI solution), this modular Mathematics reference, the companion materials reference, and the synthesis. Generated from modular Markdown with a custom static-site builder.
Mathematics is typeset with MathJax (loaded once from a CDN with Subresource Integrity; needs network on first view). Diagrams are inline SVG and follow the light/dark theme. Keyboard: / search · [ ] prev/next · t theme.