Slide 12
Slide 12 text
SPIRE 2018 in LIMA
g-m+1
, ..., gm-1
Factorization of Largest BPs
Let f = f-n
, ..., fn
, g = g-m
, ..., gm
be BPs with f the largest
In inductive steps on n > 0, we have 3 cases:
(1) | fn
| = |gm
|
(2) | fn
| > |gm
| (cannot happen)
(3) | fn
| < |gm
|
f-n+1
, ..., fn-1
g-m
gm
f-n
fn
By the inductive hypothesis,
f-n+1
, ..., fn-1
is finer than s, fn
, g-m+1
, ..., gm-1
, fn
, s,
which implies that f is finer than g
g-m+1
, ..., gm-1
s s
fn
fn
12/ 19