13.08.2013 Views

Proof Mining - Mathematics, Algorithms and Proofs

Proof Mining - Mathematics, Algorithms and Proofs

Proof Mining - Mathematics, Algorithms and Proofs

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

<strong>Proof</strong> <strong>Mining</strong><br />

THEOREM 3 (K./Paulo Oliva, APAL 2003) Let<br />

dist1(f, Pn) := inf<br />

p∈Pn<br />

continuity for f.<br />

f − p1 <strong>and</strong> ω a modulus of uniform<br />

Ψ(ω, n, ε) := min{ cnε<br />

8(n+1) 2 , cnε<br />

2<br />

cn := ⌊n/2⌋!⌈n/2⌉!<br />

2 4n+3 (n+1) 3n+1 <strong>and</strong><br />

ωn(ε) := min{ω( ε<br />

4 ),<br />

Then ∀n ∈ IN, p1, p2 ∈ Pn<br />

∀ε ∈ Q ∗ +(<br />

ε<br />

40(n+1) 4 ⌈ 1<br />

ω(1) ⌉}.<br />

cnε ωn( 2 )}, where<br />

2<br />

(f−pi1−dist1(f, Pn) ≤ Ψ(ω, n, ε)) → p1−p21 ≤ ε).<br />

i=1<br />

Ulrich Kohlenbach 2

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!