pigeonhole-argument

Community

Prove existence with the pigeonhole principle.

Author0bserver07
Version1.0.0
Installs0

System Documentation

What problem does it solve?

Prove existence in mathematical problems by applying the pigeonhole principle: if n+1 items are placed into n holes, some hole contains at least two items.

Core Features & Use Cases

  • Formalization: identifies items (pigeons) and categories (holes) and constructs a mapping from items to categories.
  • Use cases: prove duplicates in attribute sets (e.g., hair counts), mutual relationships in groups, or divisibility properties via modular reasoning; adaptable to varying n.
  • Lean-based formalization path: supports machine-checked proofs and verification when needed.

Quick Start

Provide a problem statement with more items than categories and I will generate a pigeonhole-based existence proof.

Dependency Matrix

Required Modules

None required

Components

Standard package

💻 Claude Code Installation

Recommended: Let Claude install automatically. Simply copy and paste the text below to Claude Code.

Please help me install this Skill:
Name: pigeonhole-argument
Download link: https://github.com/0bserver07/bourbaki/archive/main.zip#pigeonhole-argument

Please download this .zip file, extract it, and install it in the .claude/skills/ directory.
View Source Repository

Agent Skills Search Helper

Install a tiny helper to your Agent, search and equip skill from 223,000+ vetted skills library on demand.