introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
3.58 kB
import Mathlib
namespace OAI
noncomputable section
open scoped BigOperators
namespace MatrixMultiplication.Arithmetic
inductive Gate (F Input Register : Type*) where
| constant : F β†’ Gate F Input Register
| input : Input β†’ Gate F Input Register
| add : Register β†’ Register β†’ Gate F Input Register
| sub : Register β†’ Register β†’ Gate F Input Register
| mul : Register β†’ Register β†’ Gate F Input Register
namespace Gate
variable {F Input Register : Type*}
def eval [Field F] (inputs : Input β†’ F) (registers : Register β†’ F) :
Gate F Input Register β†’ F
| .constant z => z
| .input i => inputs i
| .add i j => registers i + registers j
| .sub i j => registers i - registers j
| .mul i j => registers i * registers j
def cost : Gate F Input Register β†’ β„•
| .constant _ => 0
| .input _ => 0
| .add _ _ => 1
| .sub _ _ => 1
| .mul _ _ => 1
end Gate
inductive Program (F Input : Type*) : β„• β†’ Type _ where
| nil : Program F Input 0
| step {r : β„•} : Program F Input r β†’ Gate F Input (Fin r) β†’ Program F Input (r + 1)
namespace Program
variable {F Input : Type*}
def eval [Field F] : {r : β„•} β†’ Program F Input r β†’ (Input β†’ F) β†’ Fin r β†’ F
| 0, .nil, _ => Fin.elim0
| _ + 1, .step p g, inputs =>
Fin.cases (g.eval inputs (p.eval inputs)) (p.eval inputs)
def cost : {r : β„•} β†’ Program F Input r β†’ β„•
| 0, .nil => 0
| _ + 1, .step p g => p.cost + g.cost
end Program
abbrev MatrixInput (a b c : β„•) := (Fin a Γ— Fin b) βŠ• (Fin b Γ— Fin c)
def matrixInputs {F : Type*} {a b c : β„•}
(A : Matrix (Fin a) (Fin b) F) (B : Matrix (Fin b) (Fin c) F) :
MatrixInput a b c β†’ F
| .inl (i, j) => A i j
| .inr (j, k) => B j k
structure MatrixAlgorithm (F : Type*) (a b c : β„•) where
registers : β„•
program : Program F (MatrixInput a b c) registers
output : Fin a β†’ Fin c β†’ Fin registers
namespace MatrixAlgorithm
variable {F : Type*} [Field F] {a b c : β„•}
def eval (P : MatrixAlgorithm F a b c)
(A : Matrix (Fin a) (Fin b) F) (B : Matrix (Fin b) (Fin c) F) :
Matrix (Fin a) (Fin c) F :=
fun i k => P.program.eval (matrixInputs A B) (P.output i k)
def Correct (P : MatrixAlgorithm F a b c) : Prop :=
βˆ€ (A : Matrix (Fin a) (Fin b) F) (B : Matrix (Fin b) (Fin c) F), P.eval A B = A * B
def cost (P : MatrixAlgorithm F a b c) : β„• := P.program.cost
end MatrixAlgorithm
/-- Positive slack, one uniform constant, and a correct program at every size. -/
def AdmissibleExponent (F : Type*) [Field F] (Ο„ : ℝ) : Prop :=
βˆ€ Ξ΅ : ℝ, 0 < Ξ΅ β†’ βˆƒ C : ℝ, 0 < C ∧
βˆ€ n : β„•, 1 ≀ n β†’ βˆƒ P : MatrixAlgorithm F n n n,
P.Correct ∧ (P.cost : ℝ) ≀ C * (n : ℝ) ^ (Ο„ + Ξ΅)
def omega (F : Type*) [Field F] : ℝ := sInf {Ο„ : ℝ | AdmissibleExponent F Ο„}
/-- The inner dimension of an `n Γ— n^k` by `n^k Γ— n` multiplication. -/
def innerSize (n : β„•) (k : ℝ) : β„• := ⌈(n : ℝ) ^ kβŒ‰β‚Š
def RectangularAdmissibleExponent (F : Type*) [Field F] (k Ο„ : ℝ) : Prop :=
βˆ€ Ξ΅ : ℝ, 0 < Ξ΅ β†’ βˆƒ C : ℝ, 0 < C ∧
βˆ€ n : β„•, 1 ≀ n β†’ βˆƒ P : MatrixAlgorithm F n (innerSize n k) n,
P.Correct ∧ (P.cost : ℝ) ≀ C * (n : ℝ) ^ (Ο„ + Ξ΅)
def rectangularOmega (F : Type*) [Field F] (k : ℝ) : ℝ :=
sInf {Ο„ : ℝ | RectangularAdmissibleExponent F k Ο„}
/-- The dual exponent is a supremum of exact exponent-two rectangular shapes. -/
def complexAlpha : ℝ :=
sSup {k : ℝ | k ∈ Set.Icc 0 1 ∧ rectangularOmega β„‚ k = 2}
end MatrixMultiplication.Arithmetic
end
end OAI