convex_functions:THEORY %------------------------------------------------------------------------------ % In This Theory, We Define Convex And Stricly Convex Functions. We Prove % That The Maximum Of Two Convex Functions Is Convex And That % A Convex Function Has At Most One Minimum % % Authors: Anthony Narkawicz, NASA Langley % % Version 1.0 9/23/2009 Initial Version % Version 1.1 10/21/2009 %------------------------------------------------------------------------------
java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
IMPORTING quadratic, real_fun_ops
f,g: VAR [real -> real]
A,B,C,v,w,x,y,z,t,b,c,d: VAR real
k : VAR nat
a,H: VAR posreal
aaa nnreal
% Convex
convex?(f): bool = FORALL (x,y,t): 0 <= t and t <= 1 IMPLIES
f(t*x + (1-t)*y) <= t*f(x) + (1-t)*f(y)
% Basic Properties
composition_of_convex: LEMMA (FORALL (x,y): x<=y IMPLIES g(x)<=g(y)) AND convex?
IMPLIESfA) =(()/(B-C)f(C)-(C-A/)*fBjava.lang.StringIndexOutOfBoundsException: Index 60 out of bounds for length 60
)()/C-AC- ()(-A)*()
convex_function_left_lt: LEMMAIMPLIES( t ):0= AND<java.lang.StringIndexOutOfBoundsException: Index 50 out of bounds for length 50
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
% The Following Theorem Can Help In Proofs Where Convexity Is Used % By Allowing The User To Escape The Construction Of A Specific t-value
IMPLIES t real0t t1
1t* *) AND =*
% Sometimes, it may be convenient to have the t as the coeff of x
between_point_is_wtd_av2: LEMMAFORALL (x,y,z: real): x<=z AND z<=y IMPLIESEXISTSt ): 0= ANDt=java.lang.StringIndexOutOfBoundsException: Index 50 out of bounds for length 50 AND 1t* *)
% The Minima Of Convex Functions Have Certain Fun(ction) properties
convex_const_on_connected_minconvex_min_is_connected: LEMMAconvex( ANDx< yANDx) () FORALLz: <zANDz<yIMPLIES(x ()java.lang.StringIndexOutOfBoundsException: Index 52 out of bounds for length 52 IMPLIES
(FORALL (w): f(x) <= f(w))
convex_min_is_connected: LEMMA convex AND (FORALL (z) f()<=fz)) IMPLIES
(FORALL (w): x<=w AND w<=y IMPLIES f(w) = f(x))
% Part B: Local Minima Of Convex Functions....
loc_convex_min_is_connected: LEMMA convex?(f) AND A<=x AND x<y AND y<=B AND
f() =fy)AND
(FORALL (w): x<=w ANDFORALL(): <=w AND <= fw fx)
(java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
% Helpful results about convex functions
convex_btw_pt_left_lt (x < c AND f(B)<c IMPLIES
convex_btw_pt_right_lt: LEMMA convex?(f) AND A<=x AND x<B AND ()<cIMPLIES( c AND f(B)<=c IMPLIESIMPLIES(ORALLt:0< =1IMPLIES
convex_wtd_av_lt: IMPLIES( () <=tANDt< 1IMPLIES
ftx+1t*)<cjava.lang.StringIndexOutOfBoundsException: Index 38 out of bounds for length 38
% If a convex function has x as its min, then it is increasing to the % right of x and decreasing to the left of x
convex_increasing=v= AND)java.lang.StringIndexOutOfBoundsException: Index 18 out of bounds for length 18
f(w)>=f(v)
convex_decreasing: LEMMA convex?(f) AND (FORALL (*+1t)y <tf() +(t)fyjava.lang.StringIndexOutOfBoundsException: Index 55 out of bounds for length 55
<v <x IMPLIES
f(w)> (x<fz ()<(zIMPLIES
%java.lang.StringIndexOutOfBoundsException: Index 30 out of bounds for length 30
fx)< () AND (y< ()
ft*+(-)y *() (1t*yjava.lang.StringIndexOutOfBoundsException: Index 55 out of bounds for length 55
strictly_convex_implies_convex ?()IMPLIESconvex()
strictly_convex_unique_min: LEMMA strictly_convex?(f) AND (FORALL (z):
f()< ()AND ()< (z)IMPLIES
x = y
strictly_conv_uniq_intv_min IMPLIESstrictly_convex?go )
(A <= x AND x <= B
( < ANDy< B) AND
strictly_convex()
f ?(LAMBDA) (fz)gz)) IMPLIES
x = y
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
composition_of_strictly_convex: LEMMA (FORALL ?(f+java.lang.StringIndexOutOfBoundsException: Index 38 out of bounds for length 38 AND java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0 IMPLIES?( java.lang.StringIndexOutOfBoundsException: Index 38 out of bounds for length 38
max_of_strictly_convex: LEMMA strictly_convex
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
?(( () (f),gz))
sum_of_strictly_convex: LEMMA strictly_convexjava.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0 IMPLIES strictly_convex
scal_strictly_convex: LEMMA
% Helpful results about strictly convex functions
N convex()
%
:LEMMA?((aaa)java.lang.StringIndexOutOfBoundsException: Index 49 out of bounds for length 49
quad_linear_max_convex: LEMMALET maxfun = (LAMBDA (t): max(quadratic(a,b,c)(t),
abs( IN y /= 0 AND IN convex?(maxfun)
quad_linear_max_glob_min: LEMMALET maxfun = (LAMBDA (t): max(quadratic(a,b,c)(t),
abs(x +t*y-H)) IN y /= 0 AND maxfun( (w)=0 ND(v)=0AND FORALL(z: 0< maxfun() IMPLIES
v = w
quad_linear_max_loc_min: LEMMALET maxfun = (LAMBDAIMPLIES
w
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
(w 0AND (v) =
(FORALL (z): (A <= z AND z <= B) IMPLIES 0 < IMPLIES?( (x): f(x)^) IMPLIES
v = w
% Special Case: Exponentials Of Convex Functions ?(LAMBDA:fx^k+)java.lang.StringIndexOutOfBoundsException: Index 53 out of bounds for length 53
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.