File: REAL_POLY_MUL_CONV.doc

package info (click to toggle)
hol-light 20170109-1
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 36,568 kB
  • ctags: 8,549
  • sloc: ml: 540,018; cpp: 439; lisp: 286; java: 279; makefile: 262; sh: 229; yacc: 108; perl: 78; ansic: 57; sed: 39
file content (36 lines) | stat: -rw-r--r-- 1,229 bytes parent folder | download | duplicates (4)
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
\DOC REAL_POLY_MUL_CONV

\TYPE {REAL_POLY_MUL_CONV : term -> thm}

\SYNOPSIS
Multiplies two real polynomials while retaining canonical form.

\DESCRIBE
For many purposes it is useful to retain polynomials in a canonical form. For
more information on the usual normal form in HOL Light, see the function
{REAL_POLY_CONV}, which converts a polynomial to normal form while proving the
equivalence of the original and normalized forms. The function
{REAL_POLY_MUL_CONV} is a more delicate conversion that, given a term {p1 * p2}
where {p1} and {p2} are real polynomials in normal form, returns a theorem 
{|- p1 * p2 = p} where {p} is in normal form.

\FAILURE
Fails if applied to a term that is not the product of two real terms. If these
subterms are not polynomials in normal form, the overall normalization is not
guaranteed.

\EXAMPLE
{
  # REAL_POLY_MUL_CONV `(x pow 2 + x) * (x pow 2 + -- &1 * x + &1)`;;
  val it : thm = |- (x pow 2 + x) * (x pow 2 + -- &1 * x + &1) = x pow 4 + x
}

\USES
More delicate polynomial operations that simply the direct normalization with 
{REAL_POLY_CONV}.

\SEEALSO
REAL_ARITH, REAL_POLY_ADD_CONV, REAL_POLY_CONV, REAL_POLY_NEG_CONV,
REAL_POLY_POW_CONV, REAL_POLY_SUB_CONV, REAL_RING.

\ENDDOC