Two questions facing each other

Consider three tools:

Choose {knife, scissors}. Which attributes do all chosen objects share? {cuts, grips}. Now reverse the question: which objects have all those attributes? Exactly {knife, scissors}. The answers determine each other.

Choose {knife} instead. Its shared attributes are again {cuts, grips}, and asking back returns {knife, scissors}. The singleton was not closed: the table contains no attribute that distinguishes knife from scissors.

For objects $A$, write $A'$ for all attributes common to every object in $A$. For attributes $B$, write $B'$ for all objects possessing every attribute in $B$. A pair $(A,B)$ is a formal concept when $A'=B$ and $B'=A$.

Prime twice is closure

Starting with objects and applying the operation twice, $A''$, has three laws:

• Extensive: $A\subseteq A''$. Every starting object has all attributes common to the start.
• Monotone: $A\subseteq C$ implies $A''\subseteq C''$.
• Idempotent: $A''''=A''$. Once closed, closing again adds nothing.

These are exactly the closure laws. The same holds on the attribute side. Notice the reversal between the one-prime maps: more objects can share only fewer attributes; more required attributes can be held by only fewer objects. Two order-reversing maps facing each other form a Galois connection.

This fixed point is not discovered by clustering distance or choosing a number of groups. It follows exactly from the incidence relation.

The hierarchy was already in the table

Order concepts by extent inclusion: a concept below another contains fewer objects and therefore a more specific intent. At the top sit all tools with the weak property {grips}; below are cutting tools and measuring tools; at the bottom may sit no object with an impossible combination of every attribute.

Every pair of concepts has a meet and join, so the hierarchy forms a complete concept lattice. Multiple inheritance is natural: a tool may sit beneath several broader descriptions. A hand-maintained tree would force one parent and lose information.

Implications fall out as missing distinctions

In the table, every object that cuts also grips. Write

$$\{cuts\}\to\{grips\}.$$

An attribute implication $X\to Y$ holds when every object having all of $X$ also has all of $Y$, equivalently $Y\subseteq X''$. These rules can validate entries, compress a schema, and explain why a proposed category is not distinguishable.

If one new row says a laser cuts but does not grip, the implication fails with a concrete counterexample. This is Chapter 3's proof tool embedded inside a knowledge table.

Where formal concepts run out

• Results are only as meaningful as the attributes. Closure makes bad measurement consistent; it does not make it wise.
• Dense contexts may have exponentially many concepts.
• Binary incidence discards degree unless the model deliberately scales or discretizes values.
• A formal implication is a fact of the table, not automatically a causal law about the world.

Lessons

• Objects determine shared attributes; attributes determine matching objects.
• Applying the derivation twice is a closure operator.
• Mutually closed extent–intent pairs are concepts, and their order is a lattice derived from the data.
• Attribute implications expose guaranteed co-occurrence and return counterexamples when violated.

Practice

1. Add saw: cuts=yes, grips=yes, measures=yes and recompute the closed sets generated by {cuts} and {measures}.
2. Prove $A\subseteq A''$ directly from the definition.
3. Give a data-quality rule as an attribute implication and name the counterexample row that would refute it.
4. One week later, reconstruct the phrase “objects ask attributes; attributes ask objects.”

The next question is about simultaneous work

The concept lattice is a partial order. At one level, several concepts may be mutually incomparable: none contains another. The same pattern appears in dependency schedules. The next chapter proves that the largest incomparable set is not merely a hint about parallelism—it determines the minimum number of sequential layers.

References

1. Ganter and Wille. “Formal Concept Analysis: Mathematical Foundations.” Springer, 1999. — the standard mathematical foundation
2. Wille. “Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts.” Ordered Sets, 1982. — the founding program for formal concept analysis
3. Ganter, Stumme, Wille. “Formal Concept Analysis: Theory and Applications.” Journal of Universal Computer Science, 2004. — historical overview and applications