arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1703.06133cs.LOcs.DM
收藏

Dilworths定理和Mirskys定理的全机械化证明

Fully Mechanized Proofs of Dilworths Theorem and Mirskys Theorem

Abhishek Kr Singh

摘要:

在Coq证明助手中给出了Dilworths定理和Mirskys定理的两个完全机械化的证明。Dilworths定理指出,在任何有限偏序集(偏序集)中,最小链覆盖和最大反链的大小是相同的。Mirskys定理是Dilworths定理的一个对偶。我们用Perles [2](对Dilworths定理)和Mirsky [5](对对偶定理)形式化了证明。我们还提出了一个图书馆的定义和事实,可以作为一个框架,形式化其他定理的有限偏序集。

英文摘要:

We present two fully mechanized proofs of Dilworths and Mirskys theorems in the Coq proof assistant. Dilworths Theorem states that in any finite partially ordered set (poset), the size of a smallest chain cover and a largest antichain are the same. Mirskys Theorem is a dual of Dilworths Theorem. We formalize the proofs by Perles [2] (for Dilworths Theorem) and by Mirsky [5] (for the dual theorem). We also come up with a library of definitions and facts that can be used as a framework for formalizing other theorems on finite posets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑