Skip to content

Mutual knowledge

Version
v3 · 2026-09-28 · History
Prime #
1534
Domain group
Social Sciences
Origin domain
Economics & Finance
Aliases
Everyone knows

Core Idea

Mutual knowledge is the substrate-independent first-order group epistemic condition obtained by conjoining each participant's knowledge of one proposition while leaving the tower of knowledge-about-knowledge unspecified. The abstraction is not exhausted by its familiar source-domain notation. Its autonomous core is the all-agents first-order conjunction that separates universal individual possession of a fact from public evidence and recursively shared awareness.

The operative mechanism is this: A proposition reaches or is independently learned by every agent; each local epistemic state therefore contains the proposition, but the communication or observation structure does not necessarily reveal that coverage to the others. The mechanism separates identity from observation. A case does not qualify merely because an observer can describe it using the word mutual knowledge; the constitutive relation must be present in the carrier.

How would you explain it like I'm…

Everyone Knows (Secretly)

Mom tells each kid in the family, one at a time and in secret, that there's cake in the fridge. Now every kid knows about the cake. But that doesn't tell you whether any kid knows the others know too. Everyone knowing it, each on their own, is mutual knowledge.

Everybody Knows, Maybe Alone

Mutual Knowledge is when every person in a group knows the same fact — and that's all it promises. It doesn't say whether they know that the others know. Imagine each student got the test date in a private note. All of them know the date, but none can be sure the others got the note, so no one might mention it out loud. If the teacher announced it to the whole class at once, everyone would also know that everyone else heard. That stronger kind of sharing is something extra, not part of mutual knowledge.

Everyone Knows, Nothing More

Mutual Knowledge is the condition where every member of a group knows a particular fact, with no promise about whether they know that the others know it. It's a 'first-level' condition: each person individually has the fact. For example, if each driver independently notices a traffic light is broken, the fact is mutually known — but no driver can count on the others having noticed. Contrast this with common knowledge, where everyone knows, everyone knows that everyone knows, and so on without end — the kind you get from a public announcement everyone sees together. The difference matters for coordination: people often act differently when they're sure others know, even if everyone already knows. Mutual knowledge doesn't rule out that people know about each other's knowledge; it just doesn't guarantee it.

 

Mutual Knowledge is the first-order group epistemic condition in which every agent in a declared group G knows a proposition p — formally, K_i p for all i in G, sometimes written E_G p ('everyone knows p'). It conjoins individual knowledge and deliberately leaves the higher tower unspecified: nothing is asserted about K_i K_j p (i knows that j knows p) or further iterations unless separately established. Mechanistically, p reaches or is independently learned by each agent, so each local epistemic state contains p, but the communication or observation structure need not reveal that coverage to the others — private messages, separate observations, or unshared channels typically produce it. This separates it sharply from common knowledge, where the full infinite hierarchy holds, usually via public events that everyone witnesses together. The gap is behaviorally consequential: in coordination games, the coordinated-attack problem, and the muddy children puzzle, mutual knowledge alone can fail to support action that common knowledge would enable. Diagnosing a case requires showing that every agent knows p while not assuming anything about their knowledge of each other's knowledge.

Broad Use

coordination game. The carrier is every player privately receives the same payoff-relevant fact. The identity test is that each can condition action on the fact but cannot assume the others received it. This is a literal instantiation rather than decorative analogy because the carrier, observable organization, conserved relation, variation class, and failure test retain the same roles. The domain accent is strategy can differ sharply from a public announcement. A responsible analysis states scale, observation window, representation and noise model before claiming the structure, then distinguishes the structure itself from the process used to discover, stabilize or exploit it.

Clarity

A clear Mutual knowledge claim can be rewritten as a testable sentence: on carrier C at scale S, relation R holds within tolerance T, remains under transformations V, and fails for counterexample K. This grammar exposes missing components and prevents a noun from standing in for an argument.

Manages Complexity

Mutual knowledge manages complexity by replacing an unstructured inventory with a small set of relations that survive relevant variation. Compression becomes legitimate when the retained relation supports reconstruction, comparison or reliable discrimination and the discarded details are declared incidental for the task.

The abstraction also supports chunking. Once an organized unit is established, reasoning can treat it as one object while retaining an audit trail to its elements.

Abstract Reasoning

  1. Type the carrier and explain why its elements are individuated at the selected scale.
  2. Separate the target structure from the notation, image, model or story used to display it.
  3. State the constitutive relation as an equation, rule, repeatability condition or traceable interpretive criterion.
  4. List transformations expected to preserve identity and justify why they are incidental.
  5. Choose at least one positive diagnostic and one collapse test.

Knowledge Transfer

Transfer begins from the role graph, not the name. Preserve carrier, relation, invariant, admissible variation, diagnostic and collapse test; then substitute domain occupants. A successful mapping explains how the target case would be recognized and how it would fail.

The most common transfer error is feature substitution. One field may represent the structure visually, another algebraically and another behaviorally. The visible features are not the invariant. Transfer must identify the relation those features evidence and state the target domain's measurement or proof obligations.

Relationships to Other Abstractions

Local relationship map for Mutual knowledgeParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Mutual knowledgePRIMEPrime abstraction: Epistemic Mode Of A Proposition — is a kind ofEpistemic ModeOf A PropositionPRIME

Current abstraction Mutual knowledge Prime

Parents (1) — outgoing typed relations

  • Mutual knowledge is a kind of Epistemic Mode Of A Proposition Prime

    The accepted reference-grade review places Mutual knowledge under Epistemic Mode Of A Proposition because the child instantiates or depends on the parent's broader structure while retaining its own constitutive identity.

Hierarchy path (1) — routes to 1 parentless root