[Skip Navigation] [CSUSB] / [CNS] / [Comp Sci Dept] / [R J Botting] / [ MATHS ] / math_94_Calculus
[Contents] [Source Text] || [Notation] || [Copyright] || [Contact] [Search ]
Tue Sep 18 15:18:54 PDT 2007

Contents


    The Differential and Integral Calculi

      There is a lot of work to be done here. However classical mathematics has a 200 year history of developments that are already well documented on the world wide web [ http://en.wikipedia.org/wiki/ ] (for example).

      We can approach the calculus in two ways:

      1. Formal Operations - See Math.44 Formal Calculus
      2. Topologically - Here

    1. Calculus::=Net{Differential_Calculus, Integral_Calculus, Ordinary_differential_equations, Partial_differential_equations,... }.

    2. Differential_Calculus::=
      Net{

      1. Classical_derivative::=
        Net{
        1. C::=(continuous)Real->Real,
        2. D::C<>->C,
        3. differentiable::@C=cor(D),
        4. |-for f:C, D f= map[x:Real]lim[h+>0]((f(x+h)-f(x))/h).

        5. Differentiable functions are functions where the limit above exists and is unique. A more complicated version would allow the D operator to produce partial functions when given fuctions where the limit only exists for certain values of x.

          [click here [socket symbol] if you can fill this hole]


        6. (above)|-D (_^n) = n * (_^(n-1)).
        7. (above)|-D(map[x](x^n)) = map[x](n*(x^(n-1))).
        8. (above)|-D sin = -cos, ... .
        9. (above)|-D ln = (1/_).
        10. (above)|-D (e^_) = (e^_).
        11. (above)|-D( f(g)) = D(f)(g) * D g.
        12. (above)|-D(u+v) = D u + D v.
        13. (above)|-D(u-v) = D u - D v.
        14. (above)|-D(c*u) = c*D(u), where c is a constant.
        15. (above)|-D(u*v) = u * (D v) + (D u) * v.


        16. (above)|-D(u/v) = [click here [socket symbol] if you can fill this hole]

        17. For f,g:differentiable, d f/ d g::=D(f)/D(g).

        18. The classic Liebnitz notation: dy/dx stands (roughly) for
        19. (D map[x]y)(x).

        20. Ordinary_differential_equations::=
          Net{
          1. Ordinary differential equations are a collection of equations that include several variables and their classical derivatives. They have proved a powerful tool for modeling life, death and the universe.

          2. For example the equation
          3. (ode1): D f = f.
          4. has a solution because
          5. (above)|-D(e^_)=e^_.
            However this is not the only solution because for constant a
          6. (above)|-D(a*e^_) = a*e^_.

            There is a rich, complex and elegant theory of these equations. These links [ ordinaryDiffEq.html ] [ ODE_resources.htm ] seem to be useful starting points.

            [click here [socket symbol] if you can fill this hole]


          }=::Ordinary_differential_equations.

          For h: Real E^h::(C->C)=(map[f](map[x](f(x+h))).

          [click here [socket symbol] if you can fill this hole]
          develop theory of expressions that treat E and D as an algebra: Operator_algebra(Real, {D,E}).

        21. (above)|- (Taylor): E^h = e^(h*D).

          [click here [socket symbol] if you can fill this hole]


        }=::Classical_derivative.

      2. Frechet_deriative::=
        Net{
          [click here [socket symbol] if you can fill this hole]

        }=::Frechet_deriative.


      }=::Differential_Calculus.

    3. Integral_Calculus::=
      Net{
        Here are two excellent resources: [ Integral ] to get you started. This page [ Lists_of_integrals ] has more integrals than I've seen in some books.

        Integrals are, in general, harder to calculate than differentials:-(

      1. Indefinite_integral::=
        Net{

          An indefinite integral is indefinite because D is not (1)-(1):
        1. (above)|-D(f+const) = D(f).

        2. ∫egral_sign::=/D. [click here [socket symbol] if you can fill this hole]

        }=::Indefinite_integral.

      2. Definite_integral::=
        Net{
        1. ∫egral_sign:Closed_set(Number)->Integrable_function(Number,Number)->Number. [click here [socket symbol] if you can fill this hole]

        }=::Definite_integral.


      }=::Integral_Calculus.

    4. Partial_differential_equations::=
      Net{

        [click here [socket symbol] if you can fill this hole]


      }=::Partial_differential_equations.

    . . . . . . . . . ( end of section The Differential and Integral Calculi) <<Contents | End>>

    Notes on MATHS Notation

    Special characters are defined in [ intro_characters.html ] that also outlines the syntax of expressions and a document.

    Proofs follow a natural deduction style that start with assumptions ("Let") and continue to a consequence ("Close Let") and then discard the assumptions and deduce a conclusion. Look here [ Block Structure in logic_25_Proofs ] for more on the structure and rules.

    The notation also allows you to create a new network of variables and constraints. A "Net" has a number of variables (including none) and a number of properties (including none) that connect variables. You can give them a name and then reuse them. The schema, formal system, or an elementary piece of documentation starts with "Net" and finishes "End of Net". For more, see [ notn_13_Docn_Syntax.html ] for these ways of defining and reusing pieces of logic and algebra in your documents. A quick example: a circle = Net{radius:Positive Real, center:Point}.

    For a complete listing of pages in this part of my site by topic see [ home.html ]

    Notes on the Underlying Logic of MATHS

    The notation used here is a formal language with syntax and a semantics described using traditional formal logic [ logic_0_Intro.html ] plus sets, functions, relations, and other mathematical extensions.

    For a more rigorous description of the standard notations see

  1. STANDARD::= See http://www.csci.csusb.edu/dick/maths/math_11_STANDARD.html

    Glossary

  2. above::reason="I'm too lazy to work out which of the above statements I need here", often the last 3 or 4 statements. The previous and previous but one statments are shown as (-1) and (-2).
  3. given::reason="I've been told that...", used to describe a problem.
  4. given::variable="I'll be given a value or object like this...", used to describe a problem.
  5. goal::theorem="The result I'm trying to prove right now".
  6. goal::variable="The value or object I'm trying to find or construct".
  7. let::reason="For the sake of argument let...", introduces a temporary hypothesis that survives until the end of the surrounding "Let...Close.Let" block or Case.
  8. hyp::reason="I assumed this in my last Let/Case/Po/...".
  9. QED::conclusion="Quite Easily Done" or "Quod Erat Demonstrandum", indicates that you have proved what you wanted to prove.
  10. QEF::conclusion="Quite Easily Faked", -- indicate that you have proved that the object you constructed fitted the goal you were given.
  11. RAA::conclusion="Reducto Ad Absurdum". This allows you to discard the last assumption (let) that you introduced.

End