Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

An empty vote collection is a quorum of no configuration

Proved
OpenSearchCoordination.no_votes_no_quorum

by pitimespi · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

cluster-coordinationconsensuscoordination-stateelasticsearchformal-verificationleader-electionopensearchpaxosquorumraftzen2

For every voting configuration c: VoteCollection.empty.isQuorum c = false. No member of c occurs among no votes, and 0⋅20 \cdot 20⋅2 never exceeds the number of members of c, including when c is empty.

Preamble
import Definitions.Def_OpenSearchCoordination
Formal statement
theorem OpenSearchCoordination.no_votes_no_quorum (c : VotingConfiguration) : VoteCollection.empty.isQuorum c = false := by sorry
Source
OpenSearch b2a54ba5c0defba3d1d20423e911d4bf920bab19: CoordinationState (constructor lines 84-106, isElectionQuorum 144-154, isPublishQuorum 156-158, setInitialState 180-204, handleStartJoin 213-255, handleJoin 264-339, handleClientValue 348-407, handlePublishRequest 416-460, handlePublishResponse 471-515, handleCommit 523-573, invariant 601-611, PersistedState.markLastAcceptedStateAsCommitted 703-728, commitVotingConfiguration 730-740, VoteCollection 750-814), server/src/main/java/org/opensearch/cluster/coordination/CoordinationState.java: https://github.com/opensearch-project/OpenSearch/blob/b2a54ba5c0defba3d1d20423e911d4bf920bab19/server/src/main/java/org/opensearch/cluster/coordination/CoordinationState.java#L64-L815; CoordinationMetadata.VotingConfiguration (lines 383-449, hasQuorum 405-409): https://github.com/opensearch-project/OpenSearch/blob/b2a54ba5c0defba3d1d20423e911d4bf920bab19/server/src/main/java/org/opensearch/cluster/coordination/CoordinationMetadata.java#L383-L449; ElectionStrategy (DEFAULT_INSTANCE lines 46-59, isElectionQuorum 68-88): https://github.com/opensearch-project/OpenSearch/blob/b2a54ba5c0defba3d1d20423e911d4bf920bab19/server/src/main/java/org/opensearch/cluster/coordination/ElectionStrategy.java#L44-L110; ClusterState.getVersionOrMetadataVersion (lines 239-244): https://github.com/opensearch-project/OpenSearch/blob/b2a54ba5c0defba3d1d20423e911d4bf920bab19/server/src/main/java/org/opensearch/cluster/ClusterState.java#L239-L244; Coordinator.ZEN1_BWC_TERM (line 134): https://github.com/opensearch-project/OpenSearch/blob/b2a54ba5c0defba3d1d20423e911d4bf920bab19/server/src/main/java/org/opensearch/cluster/coordination/Coordinator.java#L134; the messages StartJoinRequest.java, Join.java, PublishRequest.java, PublishResponse.java, ApplyCommitRequest.java in the same directory; test vectors from server/src/test/java/org/opensearch/cluster/coordination/CoordinationStateTests.java (https://github.com/opensearch-project/OpenSearch/blob/b2a54ba5c0defba3d1d20423e911d4bf920bab19/server/src/test/java/org/opensearch/cluster/coordination/CoordinationStateTests.java) and CoordinationMetadataTests.java (testVotingConfiguration)
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5 (independent sub-agent, blind: Lean code + auditor instructions only)

Read-back: OpenSearchCoordination.no_votes_no_quorum

Notions used

Voting configurations. A voting configuration ccc is a strictly increasing list c.nodeIdsc.\mathrm{nodeIds}c.nodeIds of natural numbers.

Quorum test. For a list LLL of naturals:

hasQuorum(c,L)=true  ⟺  2⋅∣[ x∈c.nodeIds∣x∈L ]∣>∣c.nodeIds∣.\mathrm{hasQuorum}(c, L) = \mathrm{true} \iff 2\cdot\big|[\,x \in c.\mathrm{nodeIds} \mid x \in L\,]\big| > |c.\mathrm{nodeIds}|.hasQuorum(c,L)=true⟺2⋅​[x∈c.nodeIds∣x∈L]​>∣c.nodeIds∣.

Vote collections. A vote collection vvv is a list v.nodesv.\mathrm{nodes}v.nodes of natural numbers. VoteCollection.empty\mathrm{VoteCollection.empty}VoteCollection.empty is the collection with the empty list. isQuorum(v,c):=hasQuorum(c,v.nodes)\mathrm{isQuorum}(v, c) := \mathrm{hasQuorum}(c, v.\mathrm{nodes})isQuorum(v,c):=hasQuorum(c,v.nodes).

1. Declaration

Binders. ccc: a voting configuration.

Hypotheses. None.

Conclusion. isQuorum(VoteCollection.empty,c)=false\mathrm{isQuorum}(\mathrm{VoteCollection.empty}, c) = \mathrm{false}isQuorum(VoteCollection.empty,c)=false, that is, hasQuorum(c,[ ])=false\mathrm{hasQuorum}(c, [\,]) = \mathrm{false}hasQuorum(c,[])=false.

Unfolded, no entry of c.nodeIdsc.\mathrm{nodeIds}c.nodeIds occurs in [ ][\,][], so the filtered length is 000, and 2⋅0>∣c.nodeIds∣2 \cdot 0 > |c.\mathrm{nodeIds}|2⋅0>∣c.nodeIds∣ is false.

2. What is not constrained

  • ccc is arbitrary, including the empty configuration (where 0>00 > 00>0 is false).
  • There are no hypotheses. The content is a direct computation from the definition.

3. Plain-language summary

An empty vote collection is not a quorum of any voting configuration.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by pitimespi · Nov 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me