Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Publication

Computer-assisted proof of kernel inequalities

Maryna Viazovska
2023
Datasets

Abstract

This data set provides a computer-assisted proof for the kernel inequalities needed to prove universal optimality in the paper "Universal optimality of the E_8 and Leech lattices and interpolation formulas" (by Cohn, Kumar, Miller, Radchenko, and Viazovska). It includes both our original proof using Mathematica and a revised proof using Sage.

Official source

Maryna Viazovska
2023
Datasets

Abstract

Official source

Related concepts (24)

Mathematical proof

A mathematical proof is a deductive argument for a mathematical statement, showing that the stated assumptions logically guarantee the conclusion. The argument may use other previously established statements, such as theorems; but every proof can, in principle, be constructed using only certain basic or original assumptions known as axioms, along with the accepted rules of inference. Proofs are examples of exhaustive deductive reasoning which establish logical certainty, to be distinguished from empirical arguments or non-exhaustive inductive reasoning which establish "reasonable expectation".

E8 lattice

In mathematics, the E_8 lattice is a special lattice in R^8. It can be characterized as the unique positive-definite, even, unimodular lattice of rank 8. The name derives from the fact that it is the root lattice of the E_8 root system. The norm of the E_8 lattice (divided by 2) is a positive definite even unimodular quadratic form in 8 variables, and conversely such a quadratic form can be used to construct a positive-definite, even, unimodular lattice of rank 8. The existence of such a form was first shown by H.

Computer-assisted proof

A computer-assisted proof is a mathematical proof that has been at least partially generated by computer. Most computer-aided proofs to date have been implementations of large proofs-by-exhaustion of a mathematical theorem. The idea is to use a computer program to perform lengthy computations, and to provide a proof that the result of these computations implies the given theorem. In 1976, the four color theorem was the first major theorem to be verified using a computer program.

Related publications (30)

Computer-assisted proof of kernel inequalities

Graph Chatbot

Mean value theorems for collections of lattices with a prescribed group of symmetries

SC-TPTP: An Extension of the TPTP Derivation Format for Sequent-Based Calculus

Interpolation and Quantifiers in Ortholattices