Additive Decompositions in Primitive Extensions Hao Du Key - - PowerPoint PPT Presentation

additive decompositions in primitive extensions
SMART_READER_LITE
LIVE PREVIEW

Additive Decompositions in Primitive Extensions Hao Du Key - - PowerPoint PPT Presentation

Additive Decompositions in Primitive Extensions Hao Du Key Laboratory for Mathematics Mechanization AMSS, Chinese Academy of Sciences Joint work with Shaoshi Chen and Ziming Li ISSAC18, July 1619, New York, 2018 Outline Additive


slide-1
SLIDE 1

Additive Decompositions in Primitive Extensions

Hao Du

Key Laboratory for Mathematics Mechanization AMSS, Chinese Academy of Sciences

Joint work with Shaoshi Chen and Ziming Li

ISSAC’18, July 16–19, New York, 2018

slide-2
SLIDE 2

Outline

Additive decomposition problem Previous results Additive decompositions in primitive extensions

Hermite reduction Polynomial reduction

Applications

Du, Chinese Academy of Sciences Additive Decompositions 2/17

slide-3
SLIDE 3

Terminologies

Let F be a field of characteristic zero. A derivation on F is a map ′ : F → F s.t. for all a, b ∈ F, (a + b)′ = a′ + b′ and (ab)′ = ab′ + a′b. (F, ′) is a differential field. CF = {a ∈ F | a′ = 0} is the subfield of constants. A differential field (E, D) is a differential extension of F if F ⊆ E and D |F= ′.

Du, Chinese Academy of Sciences Additive Decompositions 3/17

slide-4
SLIDE 4

Terminologies

Let F be a field of characteristic zero. A derivation on F is a map ′ : F → F s.t. for all a, b ∈ F, (a + b)′ = a′ + b′ and (ab)′ = ab′ + a′b. (F, ′) is a differential field. CF = {a ∈ F | a′ = 0} is the subfield of constants. A differential field (E, D) is a differential extension of F if F ⊆ E and D |F= ′.

  • Example. Set

′ = d/dx.

C(x), C(x, log(x)), C(x, ex), C(x, √x), . . . are differential fields.

Du, Chinese Academy of Sciences Additive Decompositions 3/17

slide-5
SLIDE 5

Additive decomposition problem

  • Notation. F ′ := {f ′ | f ∈ F}.
  • Problem. Given f ∈ F, find g, r ∈ F s.t.

f = g′ + r with the properties that f ∈ F ′ ⇐ ⇒ r = 0, r is minimal in some sense.

Du, Chinese Academy of Sciences Additive Decompositions 4/17

slide-6
SLIDE 6

Previous results

Rational functions in C(x) (Ostrogradsky 1845, Hermite 1872) Rational functions in C(x1, . . . , xn) (Bostan, Lairez and Salvy

2013)

Hyperexponential functions over C(x) (Bostan, Chen, Chyzak,

Li and Xin 2013)

Algebraic functions over C(x) (Chen, Kauers, Koutschan 2016) Fuchsian D-finite functions over C(x) (Chen, van Hoeij, Kauers,

Koutschan 2017)

D-finite functions over C(x) (van der Hoeven 2017, 2018,

Bostan, Chyzak, Lairez and Salvy 2018)

Du, Chinese Academy of Sciences Additive Decompositions 5/17

slide-7
SLIDE 7

Primitive towers

  • Definition. Let (F, ′) ⊂ (E, ′). t ∈ E is a primitive monomial if

t′ ∈ F, t is transcendental over F and CF(t) = CF. Examples. log(x) and arctan(x) are primitive monomials over C(x), Li(x):=

  • dx

log(x) is a primitive monomial over C(x, log(x)).

Du, Chinese Academy of Sciences Additive Decompositions 6/17

slide-8
SLIDE 8

Primitive towers

  • Definition. Let (F, ′) ⊂ (E, ′). t ∈ E is a primitive monomial if

t′ ∈ F, t is transcendental over F and CF(t) = CF. Examples. log(x) and arctan(x) are primitive monomials over C(x), Li(x):=

  • dx

log(x) is a primitive monomial over C(x, log(x)).

A primitive tower is F0 ⊂ F1 ⊂ · · · ⊂ Fn

  • C(x)

F0(t1) Fn−1(tn) where ti is a primitive monomial over Fi−1 for all 1 ≤ i ≤ n.

Du, Chinese Academy of Sciences Additive Decompositions 6/17

slide-9
SLIDE 9

Hermite reduction

  • Definition. Given a primitive tower F0 ⊂ · · · ⊂ Fn,

p ∈ Fn−1[tn] is tn-normal if gcd(p, p′) ∈ Fn−1; f ∈ Fn is tn-simple if f is proper and den(f ) is tn-normal.

Du, Chinese Academy of Sciences Additive Decompositions 7/17

slide-10
SLIDE 10

Hermite reduction

  • Definition. Given a primitive tower F0 ⊂ · · · ⊂ Fn,

p ∈ Fn−1[tn] is tn-normal if gcd(p, p′) ∈ Fn−1; f ∈ Fn is tn-simple if f is proper and den(f ) is tn-normal.

  • Lemma. For f ∈ Fn, there exist g, h ∈ Fn and p ∈ Fn−1[tn] s.t.

f = g′ + h + p. where h is tn-simple. Moreover, f ∈ F ′

n

= ⇒ h = 0.

Du, Chinese Academy of Sciences Additive Decompositions 7/17

slide-11
SLIDE 11

Polynomial reduction

Problem P. For p ∈ Fn−1[tn], find g, q ∈ Fn−1[tn] s.t. p = g′ + q and p ∈ F ′

n ⇐

⇒ q = 0.

Du, Chinese Academy of Sciences Additive Decompositions 8/17

slide-12
SLIDE 12

Polynomial reduction

Problem P. For p ∈ Fn−1[tn], find g, q ∈ Fn−1[tn] s.t. p = g′ + q and p ∈ F ′

n ⇐

⇒ q = 0. Main idea. For a ∈ Fn−1 and d ∈ N, a td

n = g′ + q

with degtn(q) < d.

  • a − c t′

n ∈ F ′ n−1

for some c ∈ C.

Du, Chinese Academy of Sciences Additive Decompositions 8/17

slide-13
SLIDE 13

Hermitian parts

By Hermite reduction, for f ∈ Fi, ∃! ti-simple h ∈ Fi s.t. f = g′ + h + p, where g ∈ Fi and p ∈ Fi−1[ti] for 1 ≤ i ≤ n.

  • Definition. Call h the Hermitian part of f , denoted by hpti(f ).

Du, Chinese Academy of Sciences Additive Decompositions 9/17

slide-14
SLIDE 14

Hermitian parts

By Hermite reduction, for f ∈ Fi, ∃! ti-simple h ∈ Fi s.t. f = g′ + h + p, where g ∈ Fi and p ∈ Fi−1[ti] for 1 ≤ i ≤ n.

  • Definition. Call h the Hermitian part of f , denoted by hpti(f ).

If a − c t′

n ∈ F ′ n−1 and hptn−1(t′ n) = 0, then

c = hptn−1(a) hptn−1(t′

n).

Du, Chinese Academy of Sciences Additive Decompositions 9/17

slide-15
SLIDE 15

Straight towers

  • Definition. A primitive tower F−1 ⊂ F0 ⊂ · · · ⊂ Fn with F−1 = C

and F0 = C(t0) is straight if hpti−1(t′

i) = 0 for all 1 ≤ i ≤ n.

Du, Chinese Academy of Sciences Additive Decompositions 10/17

slide-16
SLIDE 16

Straight towers

  • Definition. A primitive tower F−1 ⊂ F0 ⊂ · · · ⊂ Fn with F−1 = C

and F0 = C(t0) is straight if hpti−1(t′

i) = 0 for all 1 ≤ i ≤ n.

Define a tn-straight polynomial q ∈ Fn−1[tn]: q is t0-straight if q = 0, q is tn-straight if lctn(q) = u + v s.t.

u ∈ Fn−1 is tn−1-simple, u = c hptn−1(t′

n) for any nonzero c ∈ C,

v ∈ Fn−2[tn−1] is tn−1-straight.

Du, Chinese Academy of Sciences Additive Decompositions 10/17

slide-17
SLIDE 17

Straight towers

  • Definition. A primitive tower F−1 ⊂ F0 ⊂ · · · ⊂ Fn with F−1 = C

and F0 = C(t0) is straight if hpti−1(t′

i) = 0 for all 1 ≤ i ≤ n.

Define a tn-straight polynomial q ∈ Fn−1[tn]: q is t0-straight if q = 0, q is tn-straight if lctn(q) = u + v s.t.

u ∈ Fn−1 is tn−1-simple, u = c hptn−1(t′

n) for any nonzero c ∈ C,

v ∈ Fn−2[tn−1] is tn−1-straight.

  • Prop. Let q ∈ Fn−1[tn] be tn-straight. Then q ∈ F ′

n ⇐

⇒ q = 0.

Du, Chinese Academy of Sciences Additive Decompositions 10/17

slide-18
SLIDE 18

Flat towers

  • Definition. A primitive tower

F0 ⊂ F1 ⊂ · · · ⊂ Fn

  • C(x)

F0(t1) Fn−1(tn) is flat if t′

i ∈ F0 for all 1 ≤ i ≤ n.

Du, Chinese Academy of Sciences Additive Decompositions 11/17

slide-19
SLIDE 19

Flat towers

  • Definition. A primitive tower

F0 ⊂ F1 ⊂ · · · ⊂ Fn

  • C(x)

F0(t1) Fn−1(tn) is flat if t′

i ∈ F0 for all 1 ≤ i ≤ n.

  • Notation. For 1 ≤ i ≤ n and p ∈ Fi−1[ti, . . . , tn],

hmi(p) is the head monomial of p w.r.t ≺plex (ti ≺ . . . ≺ tn). hci(p) is the head coefficient of p.

Du, Chinese Academy of Sciences Additive Decompositions 11/17

slide-20
SLIDE 20

Flat polynomials

  • Definition. A polynomial q ∈ Fn−1[tn] is tn-flat if:

∃ qi ∈ Fi−1[ti, . . . , tn] s.t. q = n

i=1 qi,

hci(qi) is ti−1-simple for 1 ≤ i ≤ n, q1 = 0 or hc0(q1) / ∈ spanC{t′

1, . . . , t′ m} where

m =    n if hm0(q1) = 1, s if hm0(q1) = tes

s · · · ten n with es > 0

Du, Chinese Academy of Sciences Additive Decompositions 12/17

slide-21
SLIDE 21

Flat polynomials

  • Definition. A polynomial q ∈ Fn−1[tn] is tn-flat if:

∃ qi ∈ Fi−1[ti, . . . , tn] s.t. q = n

i=1 qi,

hci(qi) is ti−1-simple for 1 ≤ i ≤ n, q1 = 0 or hc0(q1) / ∈ spanC{t′

1, . . . , t′ m} where

m =    n if hm0(q1) = 1, s if hm0(q1) = tes

s · · · ten n with es > 0

  • Prop. Let q ∈ Fn−1[tn] be tn-flat. Then q ∈ F ′

n ⇐

⇒ q = 0.

Du, Chinese Academy of Sciences Additive Decompositions 12/17

slide-22
SLIDE 22

The main result

  • Theorem. Given a straight (flat) tower F0 ⊂ · · · ⊂ Fn and f ∈ Fn,

there are g ∈ Fn and q ∈ Fn−1[tn] s.t. f = g′

  • integrable

+ hptn(f ) + q

  • non-integrable

, where q is tn-straight (tn-flat). Moreover, f ∈ F ′

n ⇐

⇒ hptn(f ) = q = 0, if f = ˜ g′ + ˜ h + ˜ q for tn-proper ˜ h and ˜ q ∈ Fn−1[tn], then den(hptn(f )) | den(˜ h) and    degtn(q) ≤ degtn(˜ q) (straight) q plex ˜ q (flat).

Du, Chinese Academy of Sciences Additive Decompositions 13/17

slide-23
SLIDE 23

Examples

  • 1. Straight:

f1 = 1 log(x)Li(x) +

  • log(x) +

1 log(x)

  • Li(x) −

x log(x) ∈ C(x, log(x), Li(x))

  • 2. Flat:

f2 = arctan(x) x2 + 1 3 − log(x) arctan(x)2 x + log(x)2 ∈ C(x, log(x), arctan(x))

Du, Chinese Academy of Sciences Additive Decompositions 14/17

slide-24
SLIDE 24

Examples

  • 1. Straight:

f1 = 1 log(x)Li(x) +

  • log(x) +

1 log(x)

  • Li(x) −

x log(x) ∈ C(x, log(x), Li(x)) = (· · · )′ + 1 log(x)Li(x)

  • 2. Flat:

f2 = arctan(x) x2 + 1 3 − log(x) arctan(x)2 x + log(x)2 ∈ C(x, log(x), arctan(x)) = (. . .)′ + 1 x2 + 1 log(x)2 arctan(x)

Du, Chinese Academy of Sciences Additive Decompositions 14/17

slide-25
SLIDE 25

Application I: elementary integrability

Given a straight (flat) tower F0 ⊂ · · · ⊂ Fn and f ∈ Fn, we have f = g′ + hptn(f ) + q

  • r

.

Du, Chinese Academy of Sciences Additive Decompositions 15/17

slide-26
SLIDE 26

Application I: elementary integrability

Given a straight (flat) tower F0 ⊂ · · · ⊂ Fn and f ∈ Fn, we have f = g′ + hptn(f ) + q

  • r

. If ti is logarithmic over Fi−1 for all 1 ≤ i ≤ n, then f is elementary integrable over Fn

  • r ∈ spanC{a′/a | a ∈ Fn}.

Du, Chinese Academy of Sciences Additive Decompositions 15/17

slide-27
SLIDE 27

Application I: elementary integrability

Given a straight (flat) tower F0 ⊂ · · · ⊂ Fn and f ∈ Fn, we have f = g′ + hptn(f ) + q

  • r

. If ti is logarithmic over Fi−1 for all 1 ≤ i ≤ n, then f is elementary integrable over Fn

  • r ∈ spanC{a′/a | a ∈ Fn}.

Example. f1 = (· · · )′ + 1 log(x)Li(x) = (· · · )′ + Li(x)′ Li(x) = (· · · )′ + (log ◦Li(x))′

Du, Chinese Academy of Sciences Additive Decompositions 15/17

slide-28
SLIDE 28

Application II: creative telescoping

(F, {Dx, Dy}): a differential field with DxDy = DyDx.

  • Problem. Given f ∈ F, find nonzero L := d

i=0 ℓiDi x with

Dy(ℓi) = 0 and g in an elementary extension E of F s.t. L(x, Dx)(f ) = Dy(g) Telescoper Certificate

Du, Chinese Academy of Sciences Additive Decompositions 16/17

slide-29
SLIDE 29

Application II: creative telescoping

(F, {Dx, Dy}): a differential field with DxDy = DyDx.

  • Problem. Given f ∈ F, find nonzero L := d

i=0 ℓiDi x with

Dy(ℓi) = 0 and g in an elementary extension E of F s.t. L(x, Dx)(f ) = Dy(g) Telescoper Certificate

  • Example. t := log(x2 + y2).

f = t + 1 − 2y (x2 + y2)t2

  • NOT D-finite

.

Du, Chinese Academy of Sciences Additive Decompositions 16/17

slide-30
SLIDE 30

Application II: creative telescoping

(F, {Dx, Dy}): a differential field with DxDy = DyDx.

  • Problem. Given f ∈ F, find nonzero L := d

i=0 ℓiDi x with

Dy(ℓi) = 0 and g in an elementary extension E of F s.t. L(x, Dx)(f ) = Dy(g) Telescoper Certificate

  • Example. t := log(x2 + y2).

f = t + 1 − 2y (x2 + y2)t2

  • NOT D-finite

= Dy 1 t + yt − y

  • +

2x2 x2 + y2 .

Du, Chinese Academy of Sciences Additive Decompositions 16/17

slide-31
SLIDE 31

Application II: creative telescoping

(F, {Dx, Dy}): a differential field with DxDy = DyDx.

  • Problem. Given f ∈ F, find nonzero L := d

i=0 ℓiDi x with

Dy(ℓi) = 0 and g in an elementary extension E of F s.t. L(x, Dx)(f ) = Dy(g) Telescoper Certificate

  • Example. t := log(x2 + y2).

f = t + 1 − 2y (x2 + y2)t2

  • NOT D-finite

= Dy 1 t + yt − y

  • +

2x2 x2 + y2 ⇓ L = xDx − 1 and g = −2x2 t2(x2 + y2) − 1 t − yt + y.

Du, Chinese Academy of Sciences Additive Decompositions 16/17

slide-32
SLIDE 32

Summary

  • Result. A solution of the additive decomposition problem in

straight or flat towers without solving any Risch equations.

Du, Chinese Academy of Sciences Additive Decompositions 17/17

slide-33
SLIDE 33

Summary

  • Result. A solution of the additive decomposition problem in

straight or flat towers without solving any Risch equations. Plan. Additive decomposition in a general primitive tower Existence problem of telescopers in primitive extensions

Du, Chinese Academy of Sciences Additive Decompositions 17/17

slide-34
SLIDE 34

Summary

  • Result. A solution of the additive decomposition problem in

straight or flat towers without solving any Risch equations. Plan. Additive decomposition in a general primitive tower Existence problem of telescopers in primitive extensions

Thank you!

Du, Chinese Academy of Sciences Additive Decompositions 17/17