• Keine Ergebnisse gefunden

For each of the following statements Ak, show that there exists a boolean com- bination Bk(T

N/A
N/A
Protected

Academic year: 2022

Aktie "For each of the following statements Ak, show that there exists a boolean com- bination Bk(T"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Fachbereich Mathematik und Statistik Prof. Dr. Salma Kuhlmann

Lothar Sebastian Krapp Simon Müller

WS 2018 / 2019

Real Algebraic Geometry I

Exercise Sheet 8 Semialgebraic sets II

Exercise 29 (4 points)

Let n, s∈Nand let fi(T , X) fori= 1, . . . , s be a sequence of polynomials inn+ 1 variables with coefficients in Z. For each of the following statements Ak, show that there exists a boolean com- bination Bk(T) = Sk,1(T)∨. . .Sk,p(T) of polynomial equations and inequalities in the variables T with coefficients in Z, such that for any real closed field R and any tRn we have that Ak(t) holds true if and only ifBk(t) holds true inR.

(a) A1(t): Exactly one of the polynomialsf1(t, X), . . . , fs(t, X) has a zero inR.

(b) A2(t): Each of the polynomialsf1(t, X), . . . , fs(t, X) has the same number of distinct zeros in R.

(c) A3(t): The polynomials f1(t, X), . . . , fs(t, X) have pairwise distinct zeros, i.e. no two of these polynomials have a common zero.

(d) A4(t): For anyxR,

|{i∈ {1, . . . , s} |fi(t, x)>0}|=|{i∈ {1, . . . , s} |fi(t, x)<0}|,

i.e. the number of polynomials amongst f1(t, X), . . . , fs(t, X) which are positive in x is equal to the number of those which are negative inx.

Exercise 30 (4 points)

Let R be a real closed field.

(a) Let n ∈ N and let ARn be a semialgebraic set. Show that the closure cl(A), the interior int(A) and the boundary ∂Aof AinR are semialgebraic.

(b) Describe the closure cl(A) of the semialgebraic set

A=n(x, y)∈R2|x3x2y2 >0o.

1

(2)

Exercise 31 (4 points)

Let R be a real closed field. LetARn,BRm be semialgebraic sets for somen, m∈N.

(a) Show that any polynomial map f : AR, i.e. any map of the form f = p|A for some pR[X1, . . . Xn], is semialgebraic.

(b) Show that any regular rational mapf :AB, i.e. a map of the form f =

g1

h1, . . . ,gm

hm

withgi, hiR[X1, . . . Xn] and hi(a)6= 0 for any aA, is semialgebraic.

(c) Letf, g:ARbe semialgebraic maps. Show that the maps max(f, g) :x7→max(f(x), g(x)), min(f, g) :x7→min(f(x), g(x)) and|f|are semialgebraic.

(d) Let f :AR be a semialgebraic map with f ≥0. Show that√

f is semialgebraic.

Exercise 32 (4 points)

Let R be a real closed field, letA, B, C be semialgebraic sets and letf :AB andg:BC be semialgebraic maps.

(a) Show that gf is semialgebraic.

(b) Show that for any semialgebraic subsets SA and TB also f(S) andf−1(T) are semial- gebraic.

(c) Let S(A) := {f : AR | f is semialgebraic}. Show that S(A) endowed with pointwise addition and multiplication is a commutative ring with an identity.

Please hand in your solutions by Thursday, 20 December 2018, 08:15h (postbox 16 in F4).

2

Referenzen

ÄHNLICHE DOKUMENTE

Use also the facts that R with the usual topology is second countable and that every family of pairwise disjoint nonempty open sets must be countable.)7. Let (X, τ ) be the

b) Show that M is associative. Using a computer program is fine, as long as you provide clear and well-documented code and structure the output in a readable form.. c) Show that

b) Show that M is associative. Using a computer program is fine, as long as you provide clear and well-documented code and structure the output in a readable form.. c) Show that

Applied Automata Theory (WS 2014/2015) Technische Universit¨ at Kaiserslautern.. Exercise

Given an automaton A and a WMSO[&lt;, suc]-formula ϕ, the model checking problem asks whether every word accepted by A satisfies ϕ.. request,

[r]

This new carry bit could then be used as input for the full adder for the (i + 1)-st bits. Then transform the formula into

Let (ϕ, k) be an instance of the problem. The first step of the kernelization is to delete all trivial clauses. We argue that we are only interested in such formulas the size of