ProofAtlas

Lean evidence record

Euler Pentagonal Recurrence: Lean evidence

This technical record binds the exact theorem statement to its commit-pinned Lean source, checker results, assumptions, and publication-review status.

Read theorem page
Lean buildpassed
Unfinished proof stepsNone
Publication reviewsAccepted

Line counts exclude blank lines; comments and documentation count. The total is the commit-pinned first-party Lean import closure; Mathlib and other third-party dependencies are excluded.

Exact formal proposition

Hypotheses and conclusion

This is the meaningful proposition proved by the checked wrapper declaration. It is extracted from the same commit-pinned Lean source.

def EulerPentagonalRecurrence : Prop :=
  ∀ n : Nat, 0 < n →
    (partitionNumber n : Int) =
      ∑ k ∈ pentagonalIndicesUpTo n,
        pentagonalSign k * (partitionNumber (n - generalizedPentagonalNat k) : Int)
Definitions used in this proposition

partitionNumber

def partitionNumber (n : Nat) : Nat :=
  Fintype.card (Nat.Partition n)

generalizedPentagonalNat

def generalizedPentagonalNat (k : Int) : Nat :=
  Int.toNat (generalizedPentagonal k)

pentagonalSign

def pentagonalSign (k : Int) : Int :=
  if Odd k.natAbs then 1 else -1

pentagonalIndicesUpTo

noncomputable def pentagonalIndicesUpTo (n : Nat) : Finset Int :=
  (Finset.Icc (-(n : Int)) (n : Int)).filter fun k =>
    k ≠ 0 ∧ 0 < generalizedPentagonal k ∧ generalizedPentagonal k ≤ (n : Int)
Lean wrapper declaration

The checked endpoint names the expanded proposition above. Both come from the same commit-pinned source.

theorem eulerPentagonalRecurrence :
    EulerPentagonalRecurrence
Open main Lean file

Technical evidence record

Source identity, checker results, and assumptions

Main Lean declaration
eulerPentagonalRecurrence
Source commit
43eeaba32e31

Mechanical evidence

How Lean checked the proof

These fields support the exact Lean declaration, not a broader informal claim.

Artifact ID
artifact.known-euler-pentagonal.recurrence.v002
Declarations covered by recorded evidence
AtlasKnownTheorems.EulerPentagonal.eulerPentagonalRecurrence
AtlasKnownTheorems.EulerPentagonal.EulerPentagonalRecurrence
AtlasKnownTheorems.EulerPentagonal.euler_product_pentagonal_expansion
Lean build
passed
Recorded build time
6.0 s one machine-dependent evidence run, not a benchmark
Evidence collected
· clean-source provenance recorded
Unfinished proof check
passed
Lean toolchain
leanprover/lean4:v4.29.1
Recorded source commit
43eeaba32e31f56480e425c79fb6a3fb1aa8f500
Source SHA-256
sha256:dd7fb1cd4fc281575346ad80194107223a2264b70babdc2d0a48bc4ab5bcb35f
Statement alignment
accepted

Lean foundations

Standard foundations used by the proof

Lean reports the logical foundations below through Mathlib. They are standard proof-system foundations, not conjectural mathematical assumptions about this theorem. The recorded closure stays within the approved classical_mathlib_standard profile, with no unexpected axiom or unfinished-proof placeholder.

  • Classical.choice
  • Quot.sound
  • propext

Files and machine-readable evidence

Reproduce or inspect the recorded check

Use the complete first-party source bundle for reconstruction, or inspect the exact main file and checker evidence separately. Mathlib and other third-party dependencies are identified but not rebundled.

Checked source + agent continuation package · 1 Lean file · 1 evidence record · Download ZIPBrowse counted source onlineDownload main Lean fileDownload checker evidence (JSON)Download Apache-2.0 license

Review bindings

Publication reviews accepted

All four required publication-review gates are accepted for the retained presentation of this exact theorem. The review bindings are recorded separately from the Lean build and do not broaden the formal statement.

Read the publication-review details