Formalising Fisher's Inequality: Formal Linear Algebraic Proof Techniques in Combinatorics
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2022
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911748299161600 |
|---|---|
| author | Edmonds, Chelsea Paulson, Lawrence C. |
| author_facet | Edmonds, Chelsea Paulson, Lawrence C. |
| contents | The formalisation of mathematics is continuing rapidly, however combinatorics continues to present challenges to formalisation efforts, such as its reliance on techniques from a wide range of other fields in mathematics. This paper presents formal linear algebraic techniques for proofs on incidence structures in Isabelle/HOL, and their application to the first formalisation of Fisher's inequality. In addition to formalising incidence matrices and simple techniques for reasoning on linear algebraic representations, the formalisation focuses on the linear algebra bound and rank arguments. These techniques can easily be adapted for future formalisations in combinatorics, as we demonstrate through further application to proofs of variations on Fisher's inequality. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2207_02728 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Formalising Fisher's Inequality: Formal Linear Algebraic Proof Techniques in Combinatorics Edmonds, Chelsea Paulson, Lawrence C. Logic in Computer Science Combinatorics 68V20, 05B05, 05B20, 05D05 F.4.1; G.2 The formalisation of mathematics is continuing rapidly, however combinatorics continues to present challenges to formalisation efforts, such as its reliance on techniques from a wide range of other fields in mathematics. This paper presents formal linear algebraic techniques for proofs on incidence structures in Isabelle/HOL, and their application to the first formalisation of Fisher's inequality. In addition to formalising incidence matrices and simple techniques for reasoning on linear algebraic representations, the formalisation focuses on the linear algebra bound and rank arguments. These techniques can easily be adapted for future formalisations in combinatorics, as we demonstrate through further application to proofs of variations on Fisher's inequality. |
| title | Formalising Fisher's Inequality: Formal Linear Algebraic Proof Techniques in Combinatorics |
| topic | Logic in Computer Science Combinatorics 68V20, 05B05, 05B20, 05D05 F.4.1; G.2 |
| url | https://arxiv.org/abs/2207.02728 |