Nuprl Lemma : second-deriv-nonpos-concave
∀I:Interval
  (iproper(I)
  
⇒ (∀f,g,h:I ⟶ℝ.
        ((∀x,y:{a:ℝ| a ∈ I} .  ((x = y) 
⇒ (h[x] = h[y])))
        
⇒ d(f[x])/dx = λx.g[x] on I
        
⇒ d(g[x])/dx = λx.h[x] on I
        
⇒ (∀x:{a:ℝ| a ∈ I} . (h[x] ≤ r0))
        
⇒ concave-on(I;x.f[x]))))
Proof
Definitions occuring in Statement : 
derivative: d(f[x])/dx = λz.g[z] on I
, 
concave-on: concave-on(I;x.f[x])
, 
rfun: I ⟶ℝ
, 
i-member: r ∈ I
, 
iproper: iproper(I)
, 
interval: Interval
, 
rleq: x ≤ y
, 
req: x = y
, 
int-to-real: r(n)
, 
real: ℝ
, 
so_apply: x[s]
, 
all: ∀x:A. B[x]
, 
implies: P 
⇒ Q
, 
set: {x:A| B[x]} 
, 
natural_number: $n
Definitions unfolded in proof : 
all: ∀x:A. B[x]
, 
member: t ∈ T
, 
implies: P 
⇒ Q
, 
so_lambda: λ2x.t[x]
, 
rfun: I ⟶ℝ
, 
uall: ∀[x:A]. B[x]
, 
so_apply: x[s]
, 
prop: ℙ
, 
uimplies: b supposing a
, 
subtype_rel: A ⊆r B
, 
rev_uimplies: rev_uimplies(P;Q)
, 
rge: x ≥ y
, 
guard: {T}
, 
label: ...$L... t
, 
uiff: uiff(P;Q)
, 
and: P ∧ Q
, 
req_int_terms: t1 ≡ t2
, 
top: Top
, 
concave-on: concave-on(I;x.f[x])
, 
i-member: r ∈ I
, 
rccint: [l, u]
, 
convex-on: convex-on(I;x.f[x])
, 
false: False
, 
not: ¬A
Lemmas referenced : 
second-deriv-nonneg-convex, 
rminus_wf, 
i-member_wf, 
real_wf, 
rminus_functionality, 
req_wf, 
set_wf, 
derivative-minus, 
rleq_functionality_wrt_implies, 
int-to-real_wf, 
rleq_weakening_equal, 
rminus_functionality_wrt_rleq, 
rleq_weakening, 
all_wf, 
rleq_wf, 
derivative_wf, 
rfun_wf, 
iproper_wf, 
interval_wf, 
itermSubtract_wf, 
itermConstant_wf, 
itermMinus_wf, 
req-iff-rsub-is-0, 
real_polynomial_null, 
real_term_value_sub_lemma, 
real_term_value_const_lemma, 
real_term_value_minus_lemma, 
rccint_wf, 
i-member-convex, 
rleq-implies-rleq, 
radd_wf, 
rmul_wf, 
rsub_wf, 
itermAdd_wf, 
itermMultiply_wf, 
itermVar_wf, 
real_term_value_add_lemma, 
real_term_value_mul_lemma, 
real_term_value_var_lemma
Rules used in proof : 
cut, 
introduction, 
extract_by_obid, 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
lambdaFormation, 
hypothesis, 
sqequalHypSubstitution, 
dependent_functionElimination, 
thin, 
hypothesisEquality, 
independent_functionElimination, 
sqequalRule, 
lambdaEquality, 
isectElimination, 
applyEquality, 
setElimination, 
rename, 
dependent_set_memberEquality, 
setEquality, 
because_Cache, 
independent_isectElimination, 
functionEquality, 
natural_numberEquality, 
productElimination, 
approximateComputation, 
intEquality, 
isect_memberEquality, 
voidElimination, 
voidEquality, 
int_eqEquality
Latex:
\mforall{}I:Interval
    (iproper(I)
    {}\mRightarrow{}  (\mforall{}f,g,h:I  {}\mrightarrow{}\mBbbR{}.
                ((\mforall{}x,y:\{a:\mBbbR{}|  a  \mmember{}  I\}  .    ((x  =  y)  {}\mRightarrow{}  (h[x]  =  h[y])))
                {}\mRightarrow{}  d(f[x])/dx  =  \mlambda{}x.g[x]  on  I
                {}\mRightarrow{}  d(g[x])/dx  =  \mlambda{}x.h[x]  on  I
                {}\mRightarrow{}  (\mforall{}x:\{a:\mBbbR{}|  a  \mmember{}  I\}  .  (h[x]  \mleq{}  r0))
                {}\mRightarrow{}  concave-on(I;x.f[x]))))
Date html generated:
2018_05_22-PM-02_50_35
Last ObjectModification:
2017_10_21-PM-09_54_01
Theory : reals
Home
Index