Parametrized Problems in Lean 4

A collection of formal mathematics challenges. Select a problem, prove or disprove your bounds, and submit your solution.

Open Problems

Click a problem to view its statement and details.

Instructions

Your Lean 4 code must compile without errors and without any instances of sorry tactics.

Contributions may be written by AI, human, or the collaboration of both.

-- This is what we want to see: theorem parametrized_bound (G : SimpleGraph V) : parameter G ≤ bound := by -- Your complete proof here sorry -- NOT ALLOWED

Leaderboard

Rank Nickname Name Problem Result Date

Submit Your Solution

Upload your Lean 4 files below. One file must be named challenge_1.lean containing the theorem challenge_1.

Click to select .lean files (one must be challenge_1.lean)