Mutual knowledge¶
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.[1]
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.
The load-bearing invariant is that for a declared group G and proposition p, every agent i in G satisfies K_i p, while no condition is imposed on K_i K_j p or higher iterations unless separately established. Carrier, relation, invariant, admissible variation and collapse condition must all be typed. This blocks migration from an exact mathematical or empirical claim into a loose metaphor.[2]
Across substrates, notation and evidence change while the role graph remains. The analyst first identifies what can vary, then identifies the organization that survives those variations, then tests a nearby counterexample. This conserved decision sequence is the basis for Prime status.[3]
The strict residual is the all-agents first-order conjunction that separates universal individual possession of a fact from public evidence and recursively shared awareness. It is broader than one technique that recognizes or controls the structure and narrower than an unqualified claim of order, resemblance or usefulness. A reference-grade use therefore states both the positive test and the nearest boundary.
Structural Signature¶
- Typed carrier: the objects, states, events or observations on which the claimed organization exists.
- Granularity: the spatial, temporal, logical or institutional scale at which elements and relations are individuated.
- Constitutive relation: a repeatable, invariant or organizing relation that does more work than the shared label.
- Observation map: a declared way of measuring or representing the carrier without confusing the representation with the thing.
- Admissible variation: transformations or perturbations that preserve identity and reveal which features are incidental.
- Invariant: a relation or diagnostic that remains stable across those variations.
- Boundary counterexample: a neighboring case with superficial similarity but without the constitutive relation.
- Evidence path: proof, measurement, repeated observation or traceable interpretation supporting the claim.
- Uncertainty: sensitivity to noise, sampling, resolution, model choice and observer expectation.
- Collapse test: a change that removes the invariant and therefore destroys the identity.
- Transfer mapping: literal occupants for every role in a second substrate, not a metaphorical reuse of vocabulary.
- Use separation: discovery, prediction, control and communication are consequences or applications, not the identity itself.
What It Is Not¶
- It is not common knowledge, which adds every finite level of knowledge that others know.
- It is not distributed knowledge, where the pooled information of the group entails a fact that no individual need know.
- It is not majority belief or consensus; every declared member must know the same proposition.
- It is not necessarily produced by public communication; accidental or separate discovery can establish it.
- It is not one canonical example. An example demonstrates the abstraction but cannot define the whole class.
- It is not a detector or recognition algorithm. A fallible method can identify the structure, but method and target remain distinct.
- It is not a convenient label for anything organized. The constitutive relation and collapse test must be stated.
- It is not proof of causation. Stable structure can arise from several mechanisms, confounding or selection.
- It is not observer-free by stipulation. Measurement scale and representation can create or erase apparent structure.
- It is not universal sameness. Variation is expected, but only within a declared identity-preserving class.
- It is not value or desirability. A harmful, accidental or meaningless case can satisfy the structural test.
- It is not a promise of prediction. Recognition can be retrospective or descriptive when dynamics remain uncertain.
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. Removing the constitutive relation must make the classification fail; otherwise the label is only topical resemblance. Evidence can be mathematical, experimental, computational or documentary, but it must attach to the same role graph and expose uncertainty and counterexamples.
organization. The carrier is all team members separately learn a deadline. The identity test is that local calendars contain the date without a shared acknowledgment channel. 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 a coordination failure can persist despite universal awareness. 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. Removing the constitutive relation must make the classification fail; otherwise the label is only topical resemblance. Evidence can be mathematical, experimental, computational or documentary, but it must attach to the same role graph and expose uncertainty and counterexamples.
distributed system. The carrier is each node eventually stores the same configuration value. The identity test is that state convergence does not itself prove that nodes know convergence is complete. 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 epistemic and data consistency are distinct. 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. Removing the constitutive relation must make the classification fail; otherwise the label is only topical resemblance. Evidence can be mathematical, experimental, computational or documentary, but it must attach to the same role graph and expose uncertainty and counterexamples.
market. The carrier is all traders observe the same public statistic through private terminals. The identity test is that the datum is universally possessed even if observation reliability is not mutually visible. 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 beliefs about others' access affect action. 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. Removing the constitutive relation must make the classification fail; otherwise the label is only topical resemblance. Evidence can be mathematical, experimental, computational or documentary, but it must attach to the same role graph and expose uncertainty and counterexamples.
classroom. The carrier is every learner independently solves the same result. The identity test is that the answer is known by all without a public check. 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 the instructor and students may not know the coverage. 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. Removing the constitutive relation must make the classification fail; otherwise the label is only topical resemblance. Evidence can be mathematical, experimental, computational or documentary, but it must attach to the same role graph and expose uncertainty and counterexamples.
social group. The carrier is every member separately knows a sensitive event. The identity test is that lack of acknowledgment prevents the fact from becoming publicly discussable. 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 silence can preserve pluralistic ignorance about attitudes despite mutual factual knowledge. 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. Removing the constitutive relation must make the classification fail; otherwise the label is only topical resemblance. Evidence can be mathematical, experimental, computational or documentary, but it must attach to the same role graph and expose uncertainty and counterexamples.
Across these substrates the workflow is conserved. Define the carrier and scale; state the relation; identify transformations that should preserve it; choose a diagnostic; test positive and negative cases; estimate sensitivity; and separate recognition from causal explanation or intervention. The workflow makes Mutual knowledge portable without flattening each domain's evidence obligations.
The strongest test is residual substitution. Replace the source-domain nouns with typed roles and ask whether a second field can fill every role without changing the operation. If only the word survives, transfer is metaphorical. If carrier, relation, invariant, perturbation and collapse test survive, the Prime has literal reach. This requirement protects the encyclopedia from promoting fashionable vocabulary merely because it appears in many fields.
Scale is constitutive. A relation can be stable at one grain and disappear at another. Aggregation may manufacture regularity; high resolution may fragment a robust macroscopic object into irrelevant detail. Claims should therefore bind scale and observation window to the identity while preserving a route for comparing scales. The abstraction is not whatever remains under every imaginable magnification.
Uncertainty is also structural. Sparse data, measurement error, preprocessing and model choice can generate false positives. Confirmation should include alternative representations and held-out observations where feasible. Mathematical examples replace sampling uncertainty with convention and proof obligations, but still require precise carrier and equivalence.
Finally, use does not define identity. A structure may enable compression, explanation, prediction, aesthetic effect or control. Those payoffs motivate attention, yet a case can qualify without delivering every payoff. Conversely, an intervention may work for reasons unrelated to the claimed structure. The Prime records what the thing is before cataloging what agents do with 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.
Names often mix target, representation and process. The target is the organization in the carrier. A diagram, equation, category or narrative is a representation. Detection, classification, design and control are processes. The three can be tightly coupled, but merging them creates collision with neighboring encyclopedia nodes.
Identity needs both intension and extension. The intensional test states for a declared group G and proposition p, every agent i in G satisfies K_i p, while no condition is imposed on K_i K_j p or higher iterations unless separately established. The extension supplies diverse positive cases and instructive failures. Neither one list of examples nor one elegant definition is enough when conventions and measurement enter the boundary.
A claim should also state whether it is exact, statistical, approximate or interpretive. Exact identities require proof. Statistical identities require uncertainty and a null comparison. Interpretive identities require traceable evidence and alternative readings. The structural frame supports all four without pretending their warrants are interchangeable.
Ambiguity is resolved by the nearest-confusable test. If a candidate can be fully explained by recognition, resemblance, control, representation or one domain-specific subtype, it should route there. Mutual knowledge remains only when the all-agents first-order conjunction that separates universal individual possession of a fact from public evidence and recursively shared awareness survives that subtraction.
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. This lowers cognitive and computational load without asserting that internal variation is absent. Chunk boundaries must be reopened when transfer or failure depends on hidden detail.
It localizes disagreement. Analysts can dispute carrier boundaries, scale, relation, tolerance, evidence or causal explanation separately rather than arguing over the label as a whole. This is especially valuable where one field uses an exact definition and another uses probabilistic recognition.
It guides search by privileging transformations and counterexamples. Instead of collecting only more positive instances, the analyst asks which changes preserve identity and which destroy it. That experiment reveals the core faster than surface enumeration and reduces confirmation bias.
The primary compression hazard is false invariance. Preprocessing, selection and aggregation can make unrelated cases look stable. A reference-grade account reports what was normalized, which alternatives were tried and where the abstraction stops paying rent. Complexity is managed by controlled omission, not by hiding residuals.
Abstract Reasoning¶
- Type the carrier and explain why its elements are individuated at the selected scale.
- Separate the target structure from the notation, image, model or story used to display it.
- State the constitutive relation as an equation, rule, repeatability condition or traceable interpretive criterion.
- List transformations expected to preserve identity and justify why they are incidental.
- Choose at least one positive diagnostic and one collapse test.
- Construct a nearest counterexample that preserves surface similarity while removing the invariant.
- Test sensitivity to scale, observation window, noise, sampling and representation choice.
- Distinguish exact, approximate, statistical and interpretive claims and apply the matching evidence standard.
- Map every structural role into a second unrelated substrate to test literal transfer.
- Subtract neighboring processes such as recognition, completion, design or control and identify the remaining residual.
- Separate descriptive identity from causal origin and from practical exploitation.
- Record uncertainty, conventions and known failure domains so downstream users can rematch the claim.
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.
A second error is process substitution. A detector, classifier or design recipe can be reused while its target changes. That is method transfer, not necessarily transfer of Mutual knowledge. Conversely, the same structure can be discovered by unrelated methods. The encyclopedia node concerns the conserved target relation.
Knowledge transfer improves when negative cases travel too. For every source example, construct a target case with similar components but without for a declared group G and proposition p, every agent i in G satisfies K_i p, while no condition is imposed on K_i K_j p or higher iterations unless separately established. If analysts cannot articulate the failure, the mapping is too loose. Counterexamples prevent the Prime from expanding into a synonym for organization.
Transfer should preserve uncertainty. An exact theorem cannot make an empirical target exact, and an interpretive source does not remove target measurement requirements. What transfers is the decision architecture; warrants remain native to their domains.
The practical payoff is a reusable audit sequence. Teams can compare apparently different phenomena by the same typed questions, discover when a domain-specific subtype is sufficient, and route residuals without duplicating nodes. The result is cross-domain leverage with explicit limits rather than an analogy catalog.
Examples¶
- In coordination game, start with every player privately receives the same payoff-relevant fact. Specify the units and transformations under which sameness is being asserted. Demonstrate that each can condition action on the fact but cannot assume the others received it; then perturb a nonessential feature and verify that the identity remains, and perturb the defining relation and verify that it collapses. The boundary is strategy can differ sharply from a public announcement. The mapping is carrier → observations → relation → invariant → variation class → diagnostic failure. This walkthrough prevents one salient instance, a visual resemblance, or a successful application from substituting for the abstraction.
- In organization, start with all team members separately learn a deadline. Specify the units and transformations under which sameness is being asserted. Demonstrate that local calendars contain the date without a shared acknowledgment channel; then perturb a nonessential feature and verify that the identity remains, and perturb the defining relation and verify that it collapses. The boundary is a coordination failure can persist despite universal awareness. The mapping is carrier → observations → relation → invariant → variation class → diagnostic failure. This walkthrough prevents one salient instance, a visual resemblance, or a successful application from substituting for the abstraction.
- In distributed system, start with each node eventually stores the same configuration value. Specify the units and transformations under which sameness is being asserted. Demonstrate that state convergence does not itself prove that nodes know convergence is complete; then perturb a nonessential feature and verify that the identity remains, and perturb the defining relation and verify that it collapses. The boundary is epistemic and data consistency are distinct. The mapping is carrier → observations → relation → invariant → variation class → diagnostic failure. This walkthrough prevents one salient instance, a visual resemblance, or a successful application from substituting for the abstraction.
- In market, start with all traders observe the same public statistic through private terminals. Specify the units and transformations under which sameness is being asserted. Demonstrate that the datum is universally possessed even if observation reliability is not mutually visible; then perturb a nonessential feature and verify that the identity remains, and perturb the defining relation and verify that it collapses. The boundary is beliefs about others' access affect action. The mapping is carrier → observations → relation → invariant → variation class → diagnostic failure. This walkthrough prevents one salient instance, a visual resemblance, or a successful application from substituting for the abstraction.
- In classroom, start with every learner independently solves the same result. Specify the units and transformations under which sameness is being asserted. Demonstrate that the answer is known by all without a public check; then perturb a nonessential feature and verify that the identity remains, and perturb the defining relation and verify that it collapses. The boundary is the instructor and students may not know the coverage. The mapping is carrier → observations → relation → invariant → variation class → diagnostic failure. This walkthrough prevents one salient instance, a visual resemblance, or a successful application from substituting for the abstraction.
- In social group, start with every member separately knows a sensitive event. Specify the units and transformations under which sameness is being asserted. Demonstrate that lack of acknowledgment prevents the fact from becoming publicly discussable; then perturb a nonessential feature and verify that the identity remains, and perturb the defining relation and verify that it collapses. The boundary is silence can preserve pluralistic ignorance about attitudes despite mutual factual knowledge. The mapping is carrier → observations → relation → invariant → variation class → diagnostic failure. This walkthrough prevents one salient instance, a visual resemblance, or a successful application from substituting for the abstraction.
Structural Tensions¶
- Invariant versus variation: identity requires stability while meaningful cases retain nontrivial differences.
- Discovery versus projection: observers find structure but can also impose it through preprocessing and expectation.
- Compression versus residual loss: useful simplification can conceal details that matter under transfer or stress.
- Exactness versus tolerance: mathematical and empirical instances use different but explicit thresholds of sameness.
- Local versus global: organization at one region or scale may not extend to the whole carrier.
- Static versus dynamic: a snapshot may display structure while its persistence or generating process differs.
- Description versus explanation: specifying the relation does not alone identify why it exists.
- Recognition versus intervention: accurate classification does not guarantee controllability.
- Universality versus convention: the role graph transfers while notation and evidence standards remain local.
- Robustness versus sensitivity: the abstraction must ignore incidental variation without becoming blind to collapse.
Structural–Framed Character¶
Mutual knowledge lies near the structural end of the structural–framed spectrum. Its core is the formal conjunction that every member of a declared group knows one proposition, without any higher-order claim about who knows that others know.
The language of agents, knowledge, and public announcement adds some epistemic framing, but the condition has no default evaluative weight and arises from formal epistemic logic rather than an institution. Its agents need not be people: distributed nodes can each store the same configuration while lacking evidence that convergence is complete. The same first-order structure appears when team members separately learn a deadline, traders privately receive one statistic, or students independently solve one result. Use mostly recognizes the conjunction, although describing technical nodes as knowers adds a limited interpretive perspective. The result is strongly structural with two modest mixed diagnostics.
Substrate Independence¶
The substrate-independence score is high because coordination game, organization, distributed system, market, classroom, social group all support literal occupants for carrier, relation, invariant, variation and collapse. None supplies a privileged material substrate.
Independence does not mean content-free. The invariant remains for a declared group G and proposition p, every agent i in G satisfies K_i p, while no condition is imposed on K_i K_j p or higher iterations unless separately established. A proposed transfer that cannot instantiate that condition fails even if speakers commonly use the same word.
The abstraction spans exact and empirical carriers because its structure concerns relations and invariance, while warrant is typed locally. This is analogous to a mathematical form instantiated by noisy measurements: the target may be approximate without the concept becoming metaphorical.
The boundary is generic order. Not every organized thing is Mutual knowledge. Prime status depends on an autonomous test, diverse counterexamples and preserved roles. Where a narrower existing Prime fully captures the case, that node should be used instead.
Relationships to Other Abstractions¶
Current abstraction Mutual knowledge Prime
Parents (1) — more general patterns this builds on
-
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.A fact is mutual knowledge in a group when every member knows it, without requiring anyone to know that the others know it or any higher-order awareness. The parent is defined more broadly: The same proposition can be held in different epistemic modes — asserted-fact, assumption, axiom, hypothesis, premise, belief, conjecture — and the mode, independent of the content, gates which operations are licensed on it: you may provisionally rely on an assumption, must test a hypothesis, cannot refute an axiom within its system, must discharge a premise.
Hierarchy path (1) — routes to 1 parentless root
- Mutual knowledge → Epistemic Mode Of A Proposition
Neighborhood in Abstraction Space¶
Mutual knowledge sits among the more crowded primes in the catalog (1st percentile for distinctiveness): several abstractions describe nearly the same structure, so a description that fits it will tend to fit its neighbors too — transporting it usually means disambiguating within this family rather than landing on it exactly.
Family — Coordination, Signaling & Cascades (11 primes)
Nearest neighbors
- Information — 0.98
- Sanity check — 0.98
- Inquiry — 0.98
- Addition — 0.98
- Input/output — 0.98
Computed from structural-signature embeddings · 2026-09-10
Not to Be Confused With¶
- Common knowledge: Common knowledge adds the infinite hierarchy that everyone knows, everyone knows everyone knows, and so on.
- Shared knowledge: An informal phrase that may mean mutual, common, pooled, or merely overlapping knowledge unless its epistemic depth is typed.
- Distributed knowledge: Distributed knowledge is what the group could infer by pooling members' information; mutual knowledge requires each member individually to know the proposition.
- Pluralistic ignorance: People can share private beliefs while mistakenly believing others differ; mutual knowledge concerns the fact known, not knowledge of others' attitudes.
- Consensus: Consensus is convergence of judgments or commitments and need not involve knowledge of a factual proposition.
The prospective workspace queue contains one strict upward edge to prime:epistemic_mode_of_a_proposition. No live DAG mutation is authorized.
Solution Archetypes¶
No catalogued solution archetypes reference this prime yet.
References¶
[1] Peter Vanderschraaf, Giacomo Sillari, 'Common Knowledge', 2014-01-01. registry ↩
[2] Kyle A Thomas, Peter DeScioli, Omar Sultan Haque, Steven Pinker, 'The psychology of coordination and common knowledge', Journal of Personality and Social Psychology, 2014, doi:10.1037/a0037037. registry ↩
[3] Robert J. Aumann, 'Agreeing to Disagree,' Annals of Statistics 4(6), 1236-1239 (1976). registry ↩