File size: 3,907 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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
import Mathlib.Algebra.MvPolynomial.NoZeroDivisors
import Mathlib.Algebra.MvPolynomial.Nilpotent
import Mathlib.Data.Finsupp.Fintype

/-! # Bounded Polynomial -/

namespace OAI.ArithmeticGeometry.Models.SpreadingOut.BoundedPolynomial.Construction

noncomputable section

/-! Finite coefficient coordinates for polynomials of bounded degree. -/

open _root_.MvPolynomial
open scoped BigOperators

universe u

abbrev PolynomialBox (n d : β„•) := Fin n β†’ Fin (d + 1)

def polynomialBoxExponent {n d : β„•} (a : PolynomialBox n d) : Fin n β†’β‚€ β„• :=
  Finsupp.equivFunOnFinite.symm (fun i ↦ (a i).val)

theorem polynomialBoxExponent_injective {n d : β„•} :
    Function.Injective (@polynomialBoxExponent n d) := by
  intro a b h
  funext i
  apply Fin.ext
  exact congrArg (fun f : Fin n β†’β‚€ β„• ↦ f i) h

@[simp]
theorem polynomialBoxExponent_eq_iff {n d : β„•} (a b : PolynomialBox n d) :
    polynomialBoxExponent a = polynomialBoxExponent b ↔ a = b :=
  polynomialBoxExponent_injective.eq_iff

def boundedPolynomial {R : Type u} [CommSemiring R] {n d : β„•}
    (a : PolynomialBox n d β†’ R) : MvPolynomial (Fin n) R :=
  βˆ‘ v, monomial (polynomialBoxExponent v) (a v)

theorem boundedPolynomial_coeff {R : Type u} [CommSemiring R] {n d : β„•}
    (a : PolynomialBox n d β†’ R) (v : PolynomialBox n d) :
    (boundedPolynomial a).coeff (polynomialBoxExponent v) = a v := by
  classical
  simp [boundedPolynomial, coeff_monomial]

theorem boundedPolynomial_map {R S : Type u} [CommSemiring R] [CommSemiring S]
    {n d : β„•} (a : PolynomialBox n d β†’ R) (f : R β†’+* S) :
    MvPolynomial.map f (boundedPolynomial a) = boundedPolynomial (fun v ↦ f (a v)) := by
  simp [boundedPolynomial]

theorem support_in_polynomialBox {R : Type u} [CommSemiring R] {n d : β„•}
    (p : MvPolynomial (Fin n) R) (hp : p.totalDegree ≀ d)
    {m : Fin n β†’β‚€ β„•} (hm : m ∈ p.support) :
    βˆƒ v : PolynomialBox n d, polynomialBoxExponent v = m := by
  let v : PolynomialBox n d := fun i ↦ ⟨m i,
    Nat.lt_succ_of_le ((le_degreeOf_of_mem_support i hm).trans ((degreeOf_le_totalDegree p i).trans hp))⟩
  exact ⟨v, by ext; rfl⟩

theorem boundedPolynomial_reconstruct {R : Type u} [CommSemiring R] {n d : β„•}
    (p : MvPolynomial (Fin n) R) (hp : p.totalDegree ≀ d) :
    boundedPolynomial (fun v : PolynomialBox n d ↦ p.coeff (polynomialBoxExponent v)) = p := by
  classical
  ext m
  by_cases hm : βˆƒ v : PolynomialBox n d, polynomialBoxExponent v = m
  · obtain ⟨v, rfl⟩ := hm
    exact boundedPolynomial_coeff _ v
  Β· have hm' : m βˆ‰ p.support := fun h ↦ hm (support_in_polynomialBox p hp h)
    have hcoeff : p.coeff m = 0 := notMem_support_iff.mp hm'
    rw [hcoeff]
    have hne (v : PolynomialBox n d) : polynomialBoxExponent v β‰  m := fun h ↦ hm ⟨v, h⟩
    simp [boundedPolynomial, coeff_monomial, hne]

theorem polynomial_not_isUnit_of_nonconstant_coefficient
    {k : Type u} [Field k] {n : β„•} {p : MvPolynomial (Fin n) k}
    {m : Fin n β†’β‚€ β„•} (hm : m β‰  0) (hc : p.coeff m β‰  0) : Β¬ IsUnit p := by
  intro h
  exact hc (isNilpotent_iff_eq_zero.mp ((MvPolynomial.isUnit_iff.mp h).2 m hm))

theorem nonconstant_coefficient_of_nonunit
    {k : Type u} [Field k] {n : β„•} {p : MvPolynomial (Fin n) k}
    (hp : p β‰  0) (hu : Β¬ IsUnit p) :
    βˆƒ m : Fin n β†’β‚€ β„•, m β‰  0 ∧ p.coeff m β‰  0 := by
  classical
  by_contra h
  have hc (m : Fin n β†’β‚€ β„•) (hm : m β‰  0) : p.coeff m = 0 := by
    by_contra hc
    exact h ⟨m, hm, hc⟩
  have he : p = C (p.coeff 0) := by
    ext m
    by_cases hm : m = 0
    Β· subst m; simp
    Β· simp [coeff_C, Ne.symm hm, hc m hm]
  have hzero : p.coeff 0 β‰  0 := fun h ↦ hp (by simpa [h] using he)
  exact hu (MvPolynomial.isUnit_iff_eq_C_of_isReduced.mpr
    ⟨p.coeff 0, isUnit_iff_ne_zero.mpr hzero, he⟩)

end

end OAI.ArithmeticGeometry.Models.SpreadingOut.BoundedPolynomial.Construction