Atom (Order Theory)¶

In the mathematical field of order theory, an element a of a partially ordered set with least element 0 is an atom if 0 0 has an atom a below it, that is, there is some a such that b ≥ a :> 0.

Version: v1 · 2026-09-28 · History
Domain-specific #: 8061
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Order Theory → Mathematics

Core Idea¶

Atom (Order Theory) is treated here as the recurring mathematics, logic, and statistics identity summarized by this source-grounded definition: In the mathematical field of order theory, an element a of a partially ordered set with least element 0 is an atom if 0 0 has an atom a below it, that is, there is some a such that b ≥ a :> 0. In the mathematical field of order theory, an element a of a partially ordered set with least element 0 is an atom if 0 0 has an atom a below it, that is, there.

How would you explain it like I'm…

Just Above the Bottom

Picture Lego builds lined up by 'this one is part of that one,' with the empty table at the very bottom. A single brick sits just one step above the empty table, with nothing in between. Things that sit right above the bottom like that are called atoms.

Just-Above-Bottom Elements

In order theory, mathematicians study things that can be lined up by "is below" or "is above," even when not every pair can be compared. Suppose there is a bottom element, called 0, that is below everything. An atom is an element just above 0, with nothing else fitting in between them. If every element other than 0 has at least one atom somewhere below it, the whole arrangement is called atomic. Every finite arrangement with a bottom is atomic, but the nonnegative numbers in their usual order have no atoms at all, since between 0 and any positive number there's always a smaller positive number.

Elements Covering the Minimum

In order theory, a partially ordered set (poset) is a set with an ordering where some pairs may be incomparable. If the poset has a least element 0, an element a is an atom when a covers 0: a is above 0 and there is nothing strictly between them. A poset with 0 is called atomic if every element b other than 0 has an atom a with a ≤ b. Every finite poset with 0 is atomic, but the nonnegative real numbers in the usual order have no atoms, since between 0 and any positive number there's always another. A related but different idea is "atomistic": every element is the least upper bound (join) of a set of atoms. A three-element chain 0 < a < b is atomic but not atomistic, because b is not a join of atoms.

In order theory, given a partially ordered set with a least element 0, an element a is an atom if it covers 0, meaning 0 < a and no element c satisfies 0 < c < a. The poset is atomic if every element b > 0 has an atom a with a ≤ b. Every finite partially ordered set with 0 is atomic, whereas the nonnegative real numbers under the usual order are not atomic and indeed have no atoms, since there is always a smaller positive number. A stronger notion is relative (or strong) atomicity: for all a < b there is some c with a covered by c and c ≤ b, equivalently every interval [a, b] is atomic; every relatively atomic poset with a least element is atomic. A poset with 0 is atomistic, a distinct notion, if every element is the least upper bound of some set of atoms. For example, the three-element chain is atomic but not atomistic, because its top element is not the join of atoms. Keeping atom, atomic and atomistic separate is essential.

Scope of Application¶

Documented setting. A partially ordered set with least element 0 is called atomistic (not to be confused with atomic) if every element is the least upper bound of a set of atoms.
Coatoms. Thus, in a partially ordered set with greatest element 1, one says that.
Coatoms. the set is coatomic if every b < 1 has a coatom c above it, and.
Coatoms. the set is coatomistic if every element is the greatest lower bound of a set of coatoms.
Coatoms. The terms coatom, coatomic, and coatomistic are defined dually.

Clarity¶

A clear use of Atom (Order Theory) names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is In the mathematical field of order theory, an element a of a partially ordered set with least element 0 is an atom if 0 0 has an atom a below it, that is, there is some a such that b ≥ a :>.

Manages Complexity¶

Atom (Order Theory) compresses multiple mathematics, logic, and statistics details into a stable diagnostic relation. The source shows both the central mechanism—thus, in a partially ordered set with greatest element 1, one says that.—and the practical consequence—in the mathematical field of order theory, an element a of a partially ordered set with least element 0 is an atom if 0 0 has an atom a below it.

Abstract Reasoning¶

Type the carrier. Identify the mathematics, logic, and statistics entities to which the claim applies.
State the relation. Use the source-grounded identity: In the mathematical field of order theory, an element a of a partially ordered set with least element 0 is an atom if 0 0 has an atom a below it, that is, there is some a such that b ≥ a :> 0.
Check operation and conditions. the set is coatomic if every b < 1 has a coatom c above it, and. 4.

Knowledge Transfer¶

Within the home domain. Knowledge about Atom (Order Theory) transfers literally when a new case preserves the same carrier type, relation, and recognition test. A partially ordered set with least element 0 is called atomistic (not to be confused with atomic) if every element is the least upper bound of a set of atoms. Thus, in a partially ordered set with greatest element 1, one says that. Beyond the home domain. Transfer the broader Theory relation when the mathematics, logic, and statistics-specific differentia cannot be filled.

Relationships to Other Abstractions¶

Current abstraction Atom (Order Theory) Domain-specific

Parents (1) — more general patterns this builds on

Atom (Order Theory) is a kind of Theory Prime

Atom (Order Theory) is a strict kind of Theory: In the mathematical field of order theory, an element a of a partially ordered set with least element 0 is an atom if 0 0 has an atom a below it, that is, there is some a such that b ≥ a :> 0.

Hierarchy paths (2) — routes to 2 parentless roots

Atom (Order Theory) → Theory → Formalization → Representation → Abstraction

Show alternative path (1)

Neighborhood in Abstraction Space¶

Atom (Order Theory) sits in a sparse region of the domain-specific corpus (80^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Algebraic Structures & Order Relations (18 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08