Rigidification
Lax461425.Rigidification · concepts/Lax461425/Rigidification.lean · lax-461425
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
For every matrix-symmetric circuit , there is a reduced matrix-symmetric circuit computing the same polynomial whose size, depth, and orbit size are at most those of .
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax461425.MatrixSymmetry |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Rigidification |
| 6 | type: lemma |
| 7 | --- |
| 8 | For every matrix-symmetric circuit , there is a reduced matrix-symmetric circuit |
| 9 | computing the same polynomial whose size, depth, and orbit size are at most those of . |
| 10 | -/ |
| 11 | |
| 12 | namespace Lax461425.Rigidification |
| 13 | |
| 14 | open Circuits MatrixSymmetry |
| 15 | |
| 16 | /-- Every matrix-symmetric circuit can be replaced by a reduced matrix-symmetric circuit |
| 17 | computing the same polynomial, without increasing size, depth, or orbit size. -/ |
| 18 | axiom exists_reduced {K : Type*} [CommSemiring K] {n : ℕ} |
| 19 | (C : Circuit (Fin n × Fin n) K) (hsym : IsMatrixSymmetric C) |
| 20 | {p : MvPolynomial (Fin n × Fin n) K} (hp : C.Computes p) : |
| 21 | ∃ C' : Circuit (Fin n × Fin n) K, |
| 22 | C'.IsReduced ∧ IsMatrixSymmetric C' ∧ C'.Computes p ∧ |
| 23 | C'.size ≤ C.size ∧ C'.depth ≤ C.depth ∧ orbitSize C' ≤ orbitSize C |
| 24 | |
| 25 | end Lax461425.Rigidification |
| 26 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments