File size: 3,803 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 | import OAI.Algebra.DepthFive.ComplexEmbedding
import OAI.Algebra.DepthFive.CoefficientMap
import OAI.Algebra.DepthFive.ImmMap
import OAI.Algebra.DepthFive.CoefficientDescent
namespace OAI
noncomputable section
universe u
namespace Problem335
/-- A circuit over a countable characteristic-zero field can be realized over
`β`, with exactly the same number of gates and the same IMM identity. -/
theorem exists_complex_circuit_of_countable {K : Type u} [Field K] [CharZero K]
[Countable K] {n : β} (c : Depth5Circuit K n)
(hc : circuitValue c = imm K n) :
β d : Depth5Circuit β n, circuitValue d = imm β n β§ circuitSize d = circuitSize c := by
obtain β¨fβ© := countable_field_embeds_complex K
refine β¨c.mapCoefficients f, ?_, circuitSize_mapCoefficients f cβ©
rw [circuitValue_mapCoefficients, hc, map_imm]
/-- Any pointwise real gate-count lower bound over `β` transfers to every
countable field of characteristic zero. -/
theorem countable_circuit_bound_of_complex {K : Type u} [Field K] [CharZero K]
[Countable K] {n : β} {b : β}
(h : β d : Depth5Circuit β n,
circuitValue d = imm β n β b β€ (circuitSize d : β))
(c : Depth5Circuit K n) (hc : circuitValue c = imm K n) :
b β€ (circuitSize c : β) := by
obtain β¨d, hd, hsβ© := exists_complex_circuit_of_countable c hc
simpa only [hs] using h d hd
/-- Restriction to the coefficient subfield preserves and reflects the IMM identity. -/
theorem restrictCircuit_computes_imm {K : Type u} [Field K] {n : β}
(c : Depth5Circuit K n) :
circuitValue (restrictCircuit c) = imm (circuitCoefficientField c) n β
circuitValue c = imm K n := by
have hi := MvPolynomial.map_injective (Ο := Fin n Γ Fin n Γ Fin n)
(circuitCoefficientField c).subtype
(circuitCoefficientField c).subtype.injective
rw [β hi.eq_iff, map_circuitValue_restrictCircuit, map_imm]
/-- Every characteristic-zero IMM circuit has a same-size complex realization.
Only the finitely many occurring coefficients are embedded, not the entire field. -/
theorem exists_complex_circuit {K : Type u} [Field K] [CharZero K]
{n : β} (c : Depth5Circuit K n) (hc : circuitValue c = imm K n) :
β d : Depth5Circuit β n, circuitValue d = imm β n β§ circuitSize d = circuitSize c := by
obtain β¨d, hd, hsβ© := exists_complex_circuit_of_countable (restrictCircuit c)
((restrictCircuit_computes_imm c).mpr hc)
exact β¨d, hd, hs.trans (circuitSize_restrictCircuit c)β©
/-- Pointwise complex gate lower bounds hold over any characteristic-zero field. -/
theorem circuit_bound_of_complex {K : Type u} [Field K] [CharZero K]
{n : β} {b : β}
(h : β d : Depth5Circuit β n,
circuitValue d = imm β n β b β€ (circuitSize d : β))
(c : Depth5Circuit K n) (hc : circuitValue c = imm K n) :
b β€ (circuitSize c : β) := by
obtain β¨d, hd, hsβ© := exists_complex_circuit c hc
simpa only [hs] using h d hd
/-- The extension to characteristic zero uses the same absolute threshold as
its complex counterpart. This implication has no lower-bound assumptions other
than the precise complex conclusion. -/
theorem characteristic_zero_depth_five_lower_bound_of_complex
(h : β n0 : β, β n : β, n0 β€ n β β c : Depth5Circuit β n,
circuitValue c = imm β n β
(n : β) ^ (Real.sqrt (n : β) / 400) β€ (circuitSize c : β)) :
β n0 : β, β (K : Type u) [Field K] [CharZero K], β n : β, n0 β€ n β
β c : Depth5Circuit K n, circuitValue c = imm K n β
(n : β) ^ (Real.sqrt (n : β) / 400) β€ (circuitSize c : β) := by
obtain β¨n0, h0β© := h
refine β¨n0, ?_β©
intro K _ _ n hn c hc
exact circuit_bound_of_complex (h0 n hn) c hc
end Problem335
end
end OAI
|