How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Quadratic equations and tensor-code oracle tables
Definition
For , a QUADEQ instance over is an ordered list , where each is an binary matrix and . Use the row-major order on pairs to identify matrices with vectors in . The instance is in canonical form when for . A vector satisfies the instance when, for every , For canonical instances the sum may equivalently be restricted to . For a general matrix, its canonical representative has diagonal entries and upper entries for , with zero entries below the diagonal; it defines the same quadratic form. Equivalently, after flattening by that row-major order, . Constants in a quadratic equation are moved to the right-hand side, repeated monomials cancel modulo two, and a square is represented by the diagonal coordinate , since in . When the equation list is empty and every satisfies it; when the vector and tensor are empty and each equation has left-hand side .
For , its intended oracle pair is where the second domain is flattened in the same row-major order. Thus and , with the sum interpreted as when . Their truth-table lengths are respectively and ; if stored in one proof string, the table precedes the table. The table indexing, including the one-entry truth tables at dimension zero, is the convention of Walsh–Hadamard encoding and relative Hamming distance. The tensor coordinates and ordered-pair indexing used by the consistency test are those of Quadratic tensor consistency test.
Depends on
Used by
Dependency tree · two levels
6 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Arora and Barak, Computational Complexity: A Modern Approach, §18.4.2, proof of Theorem 18.21, printed pp. 365–366 (standard reference, not scraped)