Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Theorem

Condorcet Jury Theorem

Game Theory

The Condorcet Jury Theorem states that if each member of a group independently votes correctly on a binary question with a probability greater than one half, then the probability that a majority vote reaches the correct decision increases toward one as the size of the group grows. Named for the Marquis de Condorcet, it is a foundational result of social choice theory offering a mathematical justification for collective decision-making by majority vote.

Facts
Statement
If each voter in a group independently votes correctly on a binary question with probability greater than one half, then adding more voters increases the probability that a majority vote is correct, and in the limit the probability that the majority votes correctly approaches 1 as the number of voters increases. 1
Proof Year
1785 1
Classification
Statement Form
Inequality 1
Connections

Has Statement Form

Inequality, Concepts

Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.

Sources
1. Condorcet's jury theorem - Wikipedia
  • Lead section
    In the limit, the probability that the majority votes correctly approaches 1 as the number of voters increases.
  • Lead section, second paragraph
    The theorem was first expressed by the Marquis de Condorcet in his 1785 work Essay on the Application of Analysis to the Probability of Majority Decisions.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.