Common knowledge (logic)

Imagine you and your friends share a secret. You know it. Your friends know it too. You also know that they know it. This is called common knowledge.

It is not just about knowing a fact. It is about knowing that everyone else knows it too. This can go on and on.

If you tell a secret in private, it is not common knowledge. But if you say it out loud to a big group, it becomes common knowledge.

Math experts use this idea to solve puzzles. One puzzle is about people with blue eyes on an island. They use these rules to learn things about themselves. Common knowledge helps people work together.

Imagine you and your friends share a secret. You know it. Your friends know it too. You also know that they know it. You even know that they know that you know it! This loop of knowing can go on forever. In math, we call this common knowledge.

Common knowledge is different from just knowing a fact. If you tell a secret to one friend, it is not common knowledge. It is only mutual knowledge. But if you shout a fact to a whole group, it becomes common knowledge. Now, everyone knows the fact. Everyone also knows that everyone else heard it.

Math experts use this idea to solve tricky puzzles. One famous puzzle is about people with blue eyes on an island. In this puzzle, people use what they see to learn about themselves. They follow strict rules to make choices.

Many thinkers have studied this idea. David Lewis first wrote about it in 1969. Later, Robert Aumann used math to explain it. Computer scientists also use it to help machines work together in groups. It helps us understand how groups of people or computers share facts.

Imagine you and your friends all know a secret. You know it, and your friends know it too. You also know that they know it. You even know that they know that you know it! This loop of knowing goes on and on forever. In math, we call this special kind of shared information common knowledge. It is much stronger than just a group of people knowing the same thing. If you whisper a fact to every person in a room, they all know it. But they might not know that everyone else heard it. To make it common knowledge, the fact must be shared publicly. A loud, truthful announcement makes it so everyone knows the fact and knows that everyone else heard it too.

Mathematicians use common knowledge to solve very tricky puzzles. One famous example is the blue-eyed islander puzzle. On this island, people have blue or green eyes. They cannot see their own eye color, and they cannot talk about it. However, everyone can see everyone else's eye color. If an outsider makes a public announcement that "at least one person has blue eyes," something amazing happens. Even though everyone already saw blue eyes, the public announcement makes that fact common knowledge. This allows the blue-eyed people to use logic to figure out their own color. They can watch to see if others leave the island at dawn. Eventually, all the blue-eyed people will realize their color and leave together.

Many smart thinkers have explored this idea over many years. The philosopher David Kellogg Lewis first introduced it in 1969. In that same year, a sociologist named Morris Friedell also wrote about shared awareness. Another philosopher, Stephen Schiffer, wrote a book in 1972 called Meaning. He used the term "mutual knowledge," which works very much like common knowledge. These thinkers wanted to understand how we share ideas and meanings. Their work helped lay the foundation for how we study logic and language today.

In 1976, Robert Aumann gave this idea a mathematical shape. He used set theory to create a formal way to describe it. This was a huge step for the field of game theory. Later, in the 1980s, computer scientists became very interested in this topic too. They use these ideas to help many different systems work together. They study how groups of computers or agents can share information correctly. This helps machines make smart decisions when they are working in a large group.

Common knowledge helps us understand how the world works every day. It shows us why a public announcement is different from a private message. It also explains how people can reach an agreement without talking. In math, it connects to things like patterns and logical rules. Whether it is people on an island or computers in a network, the rules stay the same. Knowing that "everyone knows" changes how we act and what we can do. This simple idea helps us solve very big and complex problems.

Common knowledge is a unique type of shared information within a group of agents. It is much stronger than simple shared information. In a group, common knowledge of a fact occurs when every agent knows the fact, every agent knows that they know it, and every agent knows that everyone else knows it, continuing infinitely. This infinite loop of awareness is what separates common knowledge from mere mutual knowledge. While mutual knowledge involves everyone knowing a fact, common knowledge requires that the fact of everyone's knowledge is also known by everyone. This distinction is vital in fields like game theory, logic, and computer science.

To understand how common knowledge functions, consider how information is transmitted. If a truthful announcement is made publicly, the information becomes common knowledge. However, if the same information is sent to each person in a group through private messages, it only becomes mutual knowledge. Even if you tell every person privately that "everyone in the group knows the fact," it still does not reach the level of common knowledge. To achieve common knowledge, an agent must publicly announce their knowledge. If every single agent in a group publicly announces that they know a fact, then that fact becomes common knowledge for the entire group.

A famous way to visualize this concept is through the "muddy children" or "blue-eyed islander" induction puzzles. Imagine an island where some people have blue eyes and others have green eyes. No one knows their own eye color, and there is no communication allowed. Everyone can see everyone else's eye color, but they cannot see themselves. If an outsider makes a public, truthful announcement that "at least one person has blue eyes," the status of that fact changes. Before the announcement, the existence of blue eyes was mutual knowledge, but not common knowledge. The public announcement makes it common knowledge, which triggers a chain of logical deductions.

If there is exactly one person with blue eyes, they will see only green eyes and realize they must be the one. They will leave the island at the first dawn. If there are two blue-eyed people, they will each see one other blue-eyed person. They will wait for the first dawn to see if that person leaves. When no one leaves, they realize that the other person must have seen someone else with blue eyes. This realization leads both to leave on the second dawn. This process follows an inductive pattern where, if there are *k* blue-eyed people, they will all leave on the *k*th dawn.

The history of this concept spans several disciplines. The philosopher David Kellogg Lewis first introduced the idea in his 1969 study, *Convention*. In that same year, sociologist Morris Friedell defined it through the lens of shared awareness. The philosopher Stephen Schiffer also developed a similar idea called "mutual knowledge" in his 1972 book, *Meaning*. While these thinkers explored the philosophical roots, Robert Aumann provided the first mathematical formulation in 1976. He used a set-theoretical framework to define the concept, which earned him significant recognition in the field of game theory.

Mathematicians and computer scientists have since expanded these formalizations. In the 1980s, computer scientists began using epistemic logic to study common knowledge. This helps them reason about distributed systems, where multiple computers must coordinate. In modal logic, common knowledge is often defined using a fixed-point approach. This is because a standard definition would require an infinite list of formulas, which is difficult for computers to process. By using a fixed-point definition, logicians can describe the limit of this infinite loop of knowledge within a manageable mathematical structure.

Common knowledge has profound implications for how we understand social and technical systems. In game theory, Robert Aumann's agreement theorem shows that if agents have common prior probabilities and their updated beliefs become common knowledge, they must eventually agree. This concept also helps explain market efficiency and how traders interact. In the digital world, it allows engineers to design artificial agents that can function reliably in complex, multi-agent environments. Whether studying human language or computer networks, common knowledge provides the rules for how groups of individuals can truly act as a single, informed unit.