Repository navigation
JSP-000301: record Lean formalization (formalizer track) - #5142
Open
jackson-shit wants to merge 1 commit into
Open
jackson-shit wants to merge 1 commit into
jackson-shit wants to merge 1 commit into
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Submission type
Lean proof / formalization only(数学解已有:Golomb 1970,见下)。
Problem
problems/catalog-0301-0400.md#JSP-000301—— "If two consecutive positive integers are powerful, must at least one be a perfect square?"Formal statement
jsp000301¬ ∀ m: ℕ, m ≠ 0 → Powerful m → Powerful (m + 1) → IsSquare m ∨ IsSquare (m + 1),其中Powerful n:= ∀ p, p.Prime → p ∣ n → p ^ 2 ∣ n(Mathlib 无此数论定义,故自定);即:并非所有非零 powerful 数的后继都与它构成"其一为平方"的配对。作用域仅 yes/no 问句本身,不含 Erdős [Recipient] JSP-000178: Lean formalization, Erdős 184, the K_{3,n−3} lower bound for decompositions into cycles and edges #365 的计数问题,也不涉及三个连续 powerful 数。Proof submission
[ { "repository": "https://github.com/jackson-shit/justin-sun-prize-lean", "branch": "main", "commit": "50579a6ecc7ef19a41e5e55ed1e577bf97eab82d" } ]JspLean/Jsp000301.lean,定理jsp000301。IsSquare 12167 ∨ IsSquare 12168;引理证明 12167(唯一素因子 23,23² ∣ 23³)与 12168(素因子仅 2、3、13,平方皆整除)均为 powerful;又两者都在 110² 与 111² 之间故皆非平方,矛盾。证明不含sorry/admit。Reproduction
lean-toolchainpath:leanprover/lean4:v4.35.0,见仓库根目录lean-toolchain。lakefile.toml([[require]] name = "mathlib", rev = "v4.35.0")与lake-manifest.json。git clone https://github.com/jackson-shit/justin-sun-prize-lean && cd justin-sun-prize-lean && git checkout 50579a6ecc7ef19a41e5e55ed1e577bf97eab82dlake exe cache get(如可用预编译 Mathlib 缓存)或直接lake buildMathlib.Algebra.Group.Even、Mathlib.Data.Nat.Prime.Basic、Mathlib.Tactic.NormNum),未用全量import Mathlib;证明内容不受导入方式影响,构建在拿到 Mathlib oleans 后很快完成。#print axioms jsp000301,输出为[propext, Classical.choice, Quot.sound](仅标准公理)。Pre-submission Lean verification
lake build(Lean v4.35.0 + Mathlib v4.35.0 预编译缓存)。50579a6ecc7ef19a41e5e55ed1e577bf97eab82d),无差异。sorry。Attribution
Submission checklist
sorry/admit或未证假设:是。