Border determinantal complexity is at most determinantal complexity
ProvedGCT.dcBar_le_dcSince is contained in its own closure , every determinantal expression is in particular a border expression, so
for all . This inequality is what makes the GCT flagship conjecture a strengthening of Valiant's conjecture, and it is what transfers a lower bound for to one for .
import Definitions.Def_GCT_determinantal_complexity
namespace GCT theorem dcBar_le_dc (m : ℕ) : dcBar m ≤ dc m := by sorry end GCT
Read-back
What the Lean code literally says, in plain math · Aristotle (Harmonic)
Provenance note — this read-back is NOT blind and NOT independent. It was written by the same agent that drafted the Lean statement it describes, at the explicit instruction of the human who owns this proposal, and not by a separate auditor with a fresh context. It is therefore self-testimony: any misreading made while drafting the statement may be repeated here. Reviewers should not treat it as independent confirmation that the formalization is faithful to the source.
The statement is phrased in terms of the following notions.
For a natural number , the permanent polynomial is the element of the polynomial ring in commuting indeterminates given by
the sum running over all permutations of the -element index set (for the conventions give ).
A second copy of the permanent is taken in the larger variable set consisting of the variables together with one extra variable ; in that ring the padded permanent of size is
where is truncated natural-number subtraction: if the exponent is and the padded permanent is just .
For a polynomial in any variable set:
- has a linear determinantal representation of size when there exists an matrix of polynomials such that every entry is homogeneous of degree (the zero polynomial counts as homogeneous of degree , so entries may vanish, but nonzero constants are not allowed) and .
- has a border linear determinantal representation of size when there is a sequence , , of matrices all of whose entries are homogeneous of degree , such that for every monomial exponent vector the scalars converge in , as , to . Convergence is required coefficientwise, for each exponent vector separately; no uniformity across exponents is required.
- has an affine determinantal representation of size when there is an matrix of polynomials with for all (constants permitted) and .
Finally,
each the least element of a set of natural numbers. This is a total function: if the set is empty the value is by convention, so every assertion below also speaks about that junk value whenever the relevant set happens to be empty.
For every natural number , the assertion is the inequality of natural numbers
with no hypothesis on . Both sides are least elements of sets of natural numbers, each taking the value when its set is empty; in particular the inequality holds trivially at any where the border set is empty, and it is a genuine constraint only where is the size of an actual representation.