Decomposition¶

Version: v3 · 2026-08-30 · History
Prime #: 520
Origin domain: Mathematics
Also from: Engineering & Design, Computer Science & Software Engineering, Cognitive Science, Organizational & Management Science
Aliases: Divide and Conquer, Divide and Conquer Strategy

Core Idea¶

Breaking a whole into parts that, recombined, reconstitute the whole; an operation that is reversible and structure-preserving, enabling both analysis and synthesis.

How would you explain it like I'm…

Taking Apart

Decomposition is like taking a Lego castle apart so you can see each brick. If you do it carefully, you can put the bricks back and have the castle again. Looking at one brick is easier than looking at the whole castle, but you have to remember how they fit.

Breaking Into Pieces

Decomposition means breaking a whole thing into smaller parts that can be studied one at a time and then put back together to remake the whole. It works because looking at small pieces is easier than looking at everything at once. The trick is that the breaking-apart has to be done in a way you can reverse, so no information is lost. This works really well for things like Legos or machines, but sometimes a whole has properties that disappear when you pull it apart. Those properties are called emergent.

Splitting Into Parts

Decomposition is the operation of breaking a whole into constituent parts in a way that lets you study the parts independently and recombine them to recover the whole. The two key properties are reversibility (the recombination puts you back where you started) and structure preservation (the parts carry the relationships that defined the whole). When it works, complex systems become tractable: you analyze each piece, then assemble. The assumption that this is always possible powers much of science and engineering, from chemistry to software. But it isn't universal. Some systems show emergent properties, behaviors of the whole that simply don't exist in any individual part, so the decomposition loses something essential.

Decomposition is the operation of partitioning a whole into constituent parts such that the parts, when properly combined, reconstitute the whole. The two structural commitments are reversibility (no information is lost in the partition-and-reassemble round trip) and structure preservation (the relationships that define the whole are recoverable from the parts plus the recombination rule). When these hold, decomposition makes complex systems tractable: each part can be analyzed in isolation, and the whole understood as the composition of part-level analyses. Simon argued in 1962 that nearly all genuinely complex systems exhibit a nearly-decomposable architecture precisely because such architectures are the only ones evolution and engineering can reliably produce. The assumption is powerful and ubiquitous, but not universal. Systems with strong emergent properties — where the whole exhibits behaviors that no individual part possesses and that no part-wise analysis can predict — resist decomposition. Recognizing when decomposition succeeds versus when it fails is itself a core analytic skill.

Broad Use¶

Mathematics: matrix decomposition, function decomposition, prime factorization, spectral decomposition.
Engineering design: functional decomposition, work breakdown structures, hierarchical decomposition of systems.
Computer science & software: modular decomposition, microservices architecture, separation of concerns, component hierarchies.
Cognitive science: problem decomposition, sub-goaling, chunking in working memory.
Organizational management: organizational structure as division into departments, teams, roles.

Clarity¶

Names the act of separating a complex entity into constituent parts without loss of information. Emphasizes that decomposition is not destruction: the parts, when properly recombined, restore the original. Distinct from disassembly (which may be destructive) and from analysis (which can involve irreversible reduction).

Manages Complexity¶

Renders an intractable whole tractable by dividing it into smaller, independently understandable pieces. Each piece becomes a focus of attention and reasoning; patterns within pieces become visible; relationships between pieces can be designed deliberately.

Abstract Reasoning¶

Encourages thinking in terms of part-whole relationships, hierarchical structure, modularity, and interchangeability of parts. Supports counterfactual reasoning: "What if I swap this subsystem for another?" Enables reasoning at multiple levels of granularity.

Knowledge Transfer¶

Decomposition strategies learned in one domain transfer readily to others. A matrix-decomposition technique informs software-architecture decisions; a work-breakdown-structure template guides both engineering projects and organizational restructuring. The principle of orthogonal decomposition (parts that do not overlap or interfere) recurs across all domains.

Example¶

A software architect decomposing a monolithic application into microservices performs the same logical operation as a mathematician decomposing a matrix into eigenvectors: identify independent dimensions, separate concerns, and create a structure where each part is simpler and more maintainable. A team manager decomposing an organization into divisions mirrors a cognitive scientist decomposing a complex problem into sub-goals—each step breaks the problem space to allow parallel work and clearer accountability.

Relationships to Other Abstractions¶

Current abstraction Decomposition Prime

Foundational — no parent edges in the catalog.

Children (143) — more specific cases that build on this

Associated graded ring Domain-specific is a kind of Decomposition

The proposed strict upward parent is prime:decomposition.
Back-formation Domain-specific is a kind of Decomposition

The proposed strict upward parent is prime:decomposition.
Background field method Domain-specific is a kind of Decomposition

The proposed strict upward parent is prime:decomposition.
Balancing domain decomposition method Domain-specific is a kind of Decomposition

The proposed strict upward parent is prime:decomposition.
Bar complex Domain-specific is a kind of Decomposition

The proposed strict upward parent is prime:decomposition.

▸ Show 138 more

Bar (music) Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Baranyai's theorem Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Block LU decomposition Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Cavity method Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Cellular homology Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Clifford theory Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Complete sequence Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Complex differential form Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Componential analysis Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Composite structure diagram Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Connected ring Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Constituent (linguistics) Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Crout matrix decomposition Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Cut-up technique Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Cylindrical Algebraic Decomposition Domain-specific is a kind of Decomposition
**Decomposition** is the proposed immediate parent.
Decomposable measure Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Dependent component analysis Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Diamond vault Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Discourse grammar Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Discrete wavelet transform Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Disk-covering method Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Distinctive feature Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Distributed switching Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Divide-and-conquer algorithm Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Dominium directum et utile Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Doob Decomposition Theorem Domain-specific is a kind of Decomposition
Doob Decomposition is a strict domain-specific specialization of the accepted prime Decomposition: it splits one stochastic process into reconstructive components, but fixes the axis through conditional predictability.
Durfee square Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Engineering analysis Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Ewald summation Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Excisive triad Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Exhaustion by compact sets Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Extensive category Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Factorization of polynomials Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Factorization system Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
FETI-DP Domain-specific is a kind of Decomposition
the global operator is split into nonoverlapping local subproblems and recombined.
Filtered algebra Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Foliation Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Fourier Transform Domain-specific is a kind of Decomposition
Fourier transform is the decomposition species that resolves a function into independently analyzable frequency contributions and exactly recombines them.
GOMS Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Graph factorization Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Handlebody Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Hiptmair–Xu preconditioner Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Homomorphic Secret Sharing Domain-specific is a kind of Decomposition
**Decomposition** is the proposed immediate parent.
Hyleme Domain-specific is a kind of Decomposition
**Decomposition** is the strict parent: a narrative manifestation is resolved into minimal hylemes whose individual analysis and recombination expose sequence, variation, and contradiction.
IDEF0 Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Indecomposable module Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Iwasawa decomposition Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
JSJ decomposition Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Koszul–Tate resolution Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Krull–Schmidt category Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Lack-of-Fit Sum of Squares Domain-specific is a kind of Decomposition
**Decomposition** is the strict parent because residual variation is exactly split into within-setting pure error and between-mean model discrepancy.
Maschke's theorem Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Matrix factorization (algebra) Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Matrix factorization of a polynomial Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Matrix Product State Domain-specific is a kind of Decomposition
**Proposed parent: `prime:decomposition`.** An MPS decomposes a many-site coefficient tensor into site tensors and supplies an exact recombination operation—virtual-index contraction—that reconstructs the original coefficients.
Mayer–Vietoris sequence Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Mesh generation Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Methodological individualism Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Minor (linear algebra) Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Morphological analysis (problem-solving) Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Multi-time-step integration Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Multiresolution Analysis Domain-specific is a kind of Decomposition
**Decomposition** is the proposed minimal parent: MRA is a strict scale-indexed orthogonal or biorthogonal decomposition whose levels nest and whose complements add detail.
Mytheme Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Net (economics) Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Network segmentation Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Neumann–Dirichlet method Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Nodal decomposition Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Non-separable wavelet Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Nuclear operators between Banach spaces Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Paradoxical set Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Parallel computing Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Pascal's rule Domain-specific is a kind of Decomposition
Pascal's Rule instantiates Decomposition because it breaks one family of subsets into two independent exhaustive classes whose counts recombine exactly.
Pathwidth Domain-specific is a kind of Decomposition
Pathwidth instantiates Decomposition because it represents a graph through overlapping components that preserve vertex and edge information, with a path-shaped overlap discipline and an optimized bottleneck.
Perfect rectangle Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Pitch angle (particle motion) Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Polygon partition Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Principal indecomposable module Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Pseudo-abelian category Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Rank-width Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Ready-to-Assemble Furniture Domain-specific is a kind of Decomposition
The minimal prospective placement is an instantiation of `prime:decomposition`.
Rishon model Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Rising sun lemma Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
River barrier hypothesis Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Ruled variety Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Schuette–Nesbitt formula Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Schur complement method Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Semisimple module Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Separation principle Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Simulation Decomposition Domain-specific is a kind of Decomposition
**Decomposition** is the minimal live parent.
Slater–Condon rules Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Spline wavelet Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Splitting principle Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Star-mesh transform Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Steinberg formula Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Stratified space Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Structure Theorem for Finitely Generated Modules over a Principal Ideal Domain Domain-specific is a kind of Decomposition
**Decomposition.** is the broad structural parent.
Structured analysis Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Structured analysis and design technique Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Tertiary ideal Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Third normal form Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Thompson factorization Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Time-series segmentation Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Totally disconnected space Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Vitali covering lemma Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Von Neumann Paradox Domain-specific is a kind of Decomposition
Von Neumann Paradox is a strict specialization of **Decomposition**: the source set is partitioned into pieces and the parts are transformed and recombined.
Waterfall Chart Domain-specific is a kind of Decomposition
the net difference or closing total is broken into signed components that recombine to reproduce the whole; this is the proposed strict parent.
Weitzenböck identity Domain-specific is a kind of Decomposition
The proposed strict upward parent is `prime:decomposition`.
Wirtinger Derivatives Domain-specific is a kind of Decomposition
**Decomposition** is the strict parent because the two Wirtinger components divide the real differential into independently analyzable complex-linear and conjugate-linear parts that exactly reconstitute it.
Factorization Prime is a kind of Decomposition
'Not generic decomposition — factorization adds a hard constraint decomposition lacks': the parts must be same-type and recombine under a NATIVE binary operation under which the kind is closed, recovering the original exactly.
Modularity Prime is a kind of, typical Decomposition
Modularity is decomposition into discrete, independently-revisable units joined by stable interfaces.
Pipeline Prime is a kind of Decomposition
A pipeline is a specialization of decomposition that breaks a workflow into ordered stages whose outputs feed the next.
Selection Vs Transmission Decomposition Prime is a kind of Decomposition
An EXACT, residual-free specialization of decomposition: a weighted-mean change split identically into covariance-of-weight-with-trait (selection) and share-weighted within-unit change (transmission).
Top-Down Perspectives Prime is a kind of Decomposition
Top-down analysis is decomposition specialized to beginning with whole-system goals and constraints and deriving the lower-level parts and mechanisms they require.
Vulnerability Decomposition Prime is a kind of Decomposition
A multiplicative factorisation V = Exposure × Sensitivity / Adaptive-Capacity of a system-stressor pair, each factor with its own intervention family — a specialization of decomposition applied to a vulnerability scalar.
Yield Loss Prime is a kind of, typical Decomposition
The decisive move is decomposing one deficit scalar into a partition of named, rankable, removable loss channels — a specialized decompose-and-attack protocol.
Burkean Pentad Domain-specific is part of Decomposition
The fixed five-slot decomposition of a human act is a strict internal constituent of the Burkean Pentad.
DuPont Analysis Domain-specific is part of Decomposition
**`decomposition`:** the headline return is divided into explanatory components.
Finite subdivision rule Domain-specific presupposes Decomposition
**Decomposition** (`prime:decomposition`).
Language Sample Analysis Domain-specific is part of Decomposition
Decomposition is internal to LSA because the transcript is separated into morphology, syntax, lexicon, pragmatics, and discourse rather than collapsed into one score.
Line of Effort Domain-specific is part of Decomposition
A campaign condition is decomposed into bounded parallel workstreams and measurable intermediate effects.
McKay Graph Domain-specific presupposes Decomposition
McKay Graph instantiates **Representation** because it maps a tensoring operator into a graph medium with an exact readback.
Overcoding Domain-specific is part of Decomposition
Overcoding contains decomposition because it breaks a qualitative whole into separately filed coded parts without preserving their between-part sequence and relations for recomposition.
Receptive–Expressive Language Profile Domain-specific is part of Decomposition
Decomposition is internal to the profile because a global language score is split into independently inspectable receptive and expressive coordinates.
Repair Sequence Domain-specific is part of Decomposition
Repair sequence contains a decomposition that separates trouble source, initiation, and completion and cross-classifies them by agency and sequential position.
Rhetorical Situation Domain-specific is part of Decomposition
The rhetorical-situation apparatus contains a three-part decomposition of the occasion into exigence, audience, and constraints so that misfit localizes to a named slot.
Toulmin Model Domain-specific is part of Decomposition
The Toulmin Model contains a six-slot decomposition that separates an informal argument into claim, grounds, warrant, backing, qualifier, and rebuttal.
Voice Domain-specific is part of Decomposition
Decomposition is internal to the Voice framework because source, resonator, and articulator stages are separated so symptoms and interventions can be localized.
Binding Problem Prime presupposes Decomposition
The binding problem arises only after a whole's features have been separated into independently processed streams whose original co-occurrence must be recovered.
Contact-Response Decomposition Prime presupposes, typical Decomposition
Contact-Response Decomposition typically presupposes Decomposition, whose structure must already obtain for the child mechanism to be meaningful or operational.
Degrees of Freedom Prime presupposes Decomposition
Degrees of freedom presupposes decomposition because the count of independent parameters is read off the system's decomposition into independent coordinates after constraints.
Reverse Engineering Prime is part of Decomposition
Decomposition is an internal operation in reverse engineering, separating an existing system into components and relations before its design logic is reconstructed.
Stovepipe System Prime presupposes Decomposition
Every Stovepipe System presupposes Decomposition into parallel verticals; the pathology is that shared concerns are duplicated and no horizontal recomposition layer exists.
Hierarchical Radial-Basis-Function Interpolation Domain-specific is a decomposition of Decomposition
The method strictly instantiates **Decomposition**: one global dense interpolation problem is divided into bounded local systems and their results are recombined.
Branch and Bound Prime is a decomposition of Decomposition
Branch and bound is the specific shape decomposition takes for combinatorial optimization, partitioning the solution space into prunable subsets.
Dynamic Programming Prime is a decomposition of Decomposition
Dynamic programming is the specific shape decomposition takes when subproblems overlap and optimal substructure lets cached solutions compose into the full answer.
Factorial Design Prime is a decomposition of Decomposition
Factorial Design is the specific shape decomposition takes when an experiment is structured into factors with main effects and interactions.
Failure Mode and Effects Analysis (FMEA) Prime is a decomposition of Decomposition
FMEA decomposes a system or process into distinct failure modes, causes, local effects, and downstream effects for separate evaluation.
Perturbation Theory Prime is a decomposition of Decomposition
Perturbation theory is the specific shape decomposition takes when a Hamiltonian is split into a solvable part plus a small perturbing operator.

Not to Be Confused With¶

Decomposition is not Aggregation because Decomposition breaks a complex whole into constituent parts to understand structure, while Aggregation combines parts into summary or collective measures—decomposition is analytical separation, aggregation is integrative summation.
Decomposition is not Chunking because Decomposition is the systematic analysis of structure, identifying how parts relate within a whole, while Chunking is the organizational strategy of grouping elements into meaningful units—decomposition reveals existing structure, chunking imposes new organizational structure.
Decomposition is not Transformation because Decomposition breaks down structure to reveal components, while Transformation changes the form or nature of elements—decomposition is analytical disassembly, transformation is morphological change.