---
license: mit
task_categories:
  - text-generation
  - feature-extraction
language:
  - en
tags:
  - theorem-proving
  - formal-methods
  - lean4
size_categories:
  - n<1K
dataset_info:
  features:
  - {name: statement, dtype: string}
  - {name: proof, dtype: string}
  - {name: type, dtype: string}
  - {name: symbolic_name, dtype: string}
  - {name: library, dtype: string}
  - {name: filename, dtype: string}
  - {name: imports, list: string}
  - {name: deps, list: string}
  - {name: docstring, dtype: string}
  - {name: source_url, dtype: string}
  - {name: commit, dtype: string}
  splits:
  - {name: train, num_examples: 150}
  config_name: default
configs:
- config_name: default
  data_files:
  - split: train
    path: data/train-*
---

# Lean4-Paperproof

Structured dataset from **Paperproof** — Visual proof assistant.

## Source

- Repository: https://github.com/Paper-Proof/paperproof
- Commit: `c944afd12974e745b26f803acf67af02e7820271`
- Files: 30
- License: mit

## Schema

| Column | Type | Description |
|--------|------|-------------|
| statement | string | Declaration signature/claim with the leading keyword removed (verbatim slice); the full declaration minus its proof |
| proof | string | Verbatim proof/body, empty if the declaration has none |
| type | string | Declaration keyword |
| symbolic_name | string | Declaration identifier |
| library | string | Sub-library |
| filename | string | Repository-relative source path |
| imports | list[string] | File-level `Require`/`Import` modules |
| deps | list[string] | Intra-corpus identifiers referenced |
| docstring | string | Preceding documentation comment, empty if absent |
| source_url | string | Upstream repository |
| commit | string | Upstream commit extracted |

## Statistics

- Entries: 150
- With proof: 135 (90.0%)
- With docstring: 9 (6.0%)
- Libraries: 7

### By type

| Type | Count |
|---|---|
| theorem | 90 |
| def | 41 |
| structure | 11 |
| inductive | 5 |
| elab | 3 |

## Example

```
simple_ex (n m : ℕ)
  (h1 : ∀ {a b : Nat}, a + b = b + a)
  (h2 : ∀ {a b : Nat}, a = b + b):
    n + m = m + n
by
  simp [h1, h2]
```

- type: theorem | symbolic_name: `simple_ex` | Examples.lean

## Use

Each declaration is split into a `statement` (signature/claim) and a `proof` (body) that are disjoint
and together form the complete declaration, for proof modeling, autoformalization, retrieval, and
dependency analysis via `deps`.

## Citation

```bibtex
@misc{lean4_paperproof_dataset,
  title  = {Lean4-Paperproof},
  author = {Norton, Charles},
  year   = {2026},
  note   = {Extracted from https://github.com/Paper-Proof/paperproof, commit c944afd12974},
  url    = {https://huggingface.co/datasets/phanerozoic/Lean4-Paperproof}
}
```