Chapter 11. Partial Derivatives and Tangent Planes

  • The definition of Partial Differentiation is as we know.
  • It seems that can also be written as .
    • Oh, they don’t use dashes or anything (blu3mo).
    • It can be confusing, right? (takker)
  • There are four patterns for Second Partial Derivatives.
    • .
    • Well, that’s how it is (blu3mo).
  • The Gradient Vector is represented as .
    • This represents the direction of steepest ascent on the tangent plane.
  • Critical Points
  • Functions of Two Variables
    • Functions like .
    • It can also be said to be a mapping from to .
  • Different functions have different 3D graph shapes.
    • represents a plane.
      • This can be defined by vectors, like in high school.
      • image
    • represents a rotational surface.
      • A rotational surface can be imagined as a solid formed by rotating a graph.
      • The input to function g is the distance from the origin to (x,y).
      • Therefore, if the coordinates have the same distance from the origin, they will have the same output.
    • represents a cylindrical surface.
      • This one is easier to imagine.
    • Rotational Paraboloid/Hyperbolic Paraboloid
  • Let’s consider .
    • If we complete the square, it becomes a form like .
      • Here, if we consider a new coordinate system , it can be expressed as .
        • I see~ (blu3mo).
        • They said that when studying linear algebra, even more complex equations can be expressed in the above form.
      • In this case, if both and are positive, it becomes a Rotational Paraboloid, and if one of them is negative, it becomes a Hyperbolic Paraboloid (6278c2ba79e11300007fcc0a).
        • It is a distorted shape because we are changing the coordinate system.
  • Methods for understanding the shape of a graph (without using differentiation)
    • Cut the graph with a plane perpendicular to the x and y axes to obtain a cross-section of the graph.
      • The curve represents the cross-section.
    • Draw Contour Lines.
      • We need to find the relationship between x and y when z is constant.
    • Determine the sign of the graph and draw it.

Chapter 6.

Chapter 5.

  • Covered until high school level.
    • Logarithmic Functions <-> Exponential Functions
      • (Strictly speaking, they are not inverse functions unless the function is defined to be a bijection)
        • For continuous functions, if it is a strictly Monotonic Functions within the domain, it is a bijection.
          • There are various types of monotonic functions, right? (takker)
            • I only know about for all and (this is the case of strictly increasing monotonicity).- The inequality becomes problematic when it includes an equal sign (nishio).
      • image
        • When the right side is used, it becomes unclear whether to choose a or b when creating the inverse image because f(a) and f(b) are equal.
      • General and strict | Monotonic function - Wikipedia Maybe this? (takker)
      • Oh, it’s just a matter of whether the equal sign is included or not.
        • Of course, that’s an important difference.
        • I see (blu3mo).
      • It was distinguished as monotone non-decreasing and monotone increasing in the text (blu3mo).
        • I prefer this way of saying it (nishio)(erniogi)(takker).
          • “Strict” is a relative expression and even just by looking at the name, it’s not clear what it means.
      • I thought there were various types like uniformly continuous functions.
  • In the case of real numbers, it’s okay because the domain is defined (takker).
      • Note:
    • So, within the range of the domain, it’s a strict monotonic function, right? (blu3mo)
    • When extended to complex numbers, it doesn’t work.
  • Trigonometric functions <-> Inverse trigonometric functions (arcsin, etc.).
    • The domain is also restricted for the same reason.
    • So, arcsin, etc. have a limited domain.
      • I learned this in IB (blu3mo).
      • image
    • The calculation of derivatives can also be derived from formulas.
      • When y=arcsinx, siny=x, so we find dx/dy and then rearrange it.
  • Hyperbolic Functions

Lec 4.

  • Differentiable Functions

  • Continuity and Differentiability

  • Intermediate Value Theorem

  • Mean Value Theorem

    • image
      • It means that there is a linear function from a to b that has the same value (slope at c) as .
      • It’s more convenient not to use fractions (takker).
        • And what does this form do…?
  • We’ll learn about monotone increasing later (blu3mo)(blu3mo)❓

  • Derivative of Inverse Functions

    • Theorem 4: If there is an inverse function g(y) of f(x), the derivative is given by .
      • This is quite non-trivial and useful (blu3mo).
      • Condition: is monotonically increasing and differentiable on an open interval I, and .
        • I want to understand why this condition is necessary ❓
        • (/icons/cheering)(takker)
  • Primitive Functions

    • I’ll study this on my own (blu3mo)❓
  • Thoughts

    • Lately, I’ve been learning quite a few obvious theorems, but how much should I understand them? (blu3mo)
      • Should I just know the conditions of the theorems? Should I understand the proofs once? Should I be able to recall the proofs at any time? Should I have the ability to prove them from scratch?
      • (takker)
        • Should I just know the conditions of the theorems?
          • If you’re doing the last-minute cramming for an exam, it’s necessary.
          • Otherwise, it’s honestly not necessary.
            • Even if the conditions of the theorem become vague, you can simply write a proof on the spot or check if it’s correct by concretizing the symbolic constants.
            • Of course, if you do this for every theorem during the exam, you’ll run out of time, so it’s more like doing problem exercises in advance and repeatedly writing proofs on the spot whenever you forget.
              • By writing it repeatedly every time you forget, you’ll eventually end up memorizing it.
        • Well, I want at least this much.
          • Should I understand the proofs once?
        • With this, I won’t have to rely on memorization.- When should we be able to recall proofs?
  • A simple example is the various trigonometric identities.

    • Even if you forget , if you know how to expand it, you can reconstruct it on the spot.
  • It is often useful to apply the techniques used in proofs to solve various problems.

  • Should we have the ability to prove from scratch?

    • The meaning of “from scratch” is a bit unclear.
    • If it means being able to prove even if you forget the proof strategy, then you have already lost the understanding of the proof.
    • To be more precise, the intention was whether we should acquire universal mathematical skills to discover these proofs on our own as we learn proofs.
    • But I don’t think that is really required.
    • Oh, that would require being a genius, a madman, or a god, so it’s okay.
    • However, it would be good to try manipulating proofs or considering alternative approaches if you have the time.
      • With this, you can discover methods from scratch to some extent.

Lec 3.

Lec 2.

Lec 1.

  • Predicate Logic.

  • What is Predicate Logic?

    • Assertions about variables.
    • Negation of propositions.
      • The negation of is .
        • This negation basically says that there exists a counterexample.
      • The negation of is .
      • I feel a bit of De Morgan’s Laws in this.
    • Concrete examples.
      • If you define a Subset properly, it should be .
    • The one that makes “if-then” into a logical formula.
      • When I saw it in Math Girl, I couldn’t understand it, but now I get it.
      • is equivalent to .
        • I understand that “if P is false or Q is true, then ‘P implies Q’ is true.”
      • With this, for example, when defining an Injective Function,
        • “If” version:
        • Logical formula version:
          • The important thing is that “if” becomes “or” in the logical formula.
          • I see, this will take some time to get used to.
        • Is “if” treated as something different from a logical symbol?
          • In logic, “if” is one of the logical symbols, just like or , so I felt a discrepancy in this comparison.
          • Ah, that’s right.
            • We call it a logical symbol when we express everything using and, or, not.
    • \forall and \exists can be chained just by listing them.
      • and have the same meaning.
        • It’s a hassle to write each time.
        • In 6253d65579e1130000d36f06, I had the realization that can be expressed without any problems by listing them as .
        • Oh, I see.
          • That’s also important.
          • It’s obvious, but it would be good to try proving by hand to understand it.
          • Being able to question things and try to understand them on your own is the best thing about mathematics.- This is similar to programming where you can execute and see the results immediately.
  • Can you chain forall and exists together?

    • Yes, you can do something like (takker)
    • You cannot reverse the order (blu3mo)
    • It seems like something you have to try out to see (takker)
      • Does hold?
    • If either forall or exists is chained, changing the order is not a problem, but you cannot rearrange forall and exists (blu3mo)
      • You can change to
      • However, you cannot change to
    • You can create questions or problems like, does hold? (takker)
      • You can create various variations and explore them in depth to pass the time
  • Upper bound and lower bound

    • b is an upper bound of set A if
    • , in other words, b is greater than all elements of A in Japanese
      • It is important that it is defined as ≤ instead of <
  • Maximum element, minimum element: min/max within a set

    • Basically, [].max(), [].min()
    • There is no maximum element in [0, 1) because 1 is not an element of this set
      • Why not consider as the maximum element? (blu3mo)
        • Ah, but if we define limits using the epsilon-delta definition, then lim is not a function that returns a specific value
          • It is a concept separate from values
          • So we cannot call it the maximum element
        • Limits are not relevant (takker)
          • It simply does not fit the definition of a maximum element
          • It is already written in 625d718779e11300008fbc5e. It was an unnecessary comment
  • Upper bound and lower bound

    • Different definitions from maximum element
    • The minimum element of the set of upper bounds of a set
    • Here, 1 is an upper bound of [0, 1]
      • An upper bound b is defined as a≦b for any element a, not a<b
    • The maximum element of [0, 1) is not 1, but the upper bound is 1
      • In fact, this is why the upper bound is defined
    • The upper bound of set A is denoted as , and the lower bound as
  • It is easier to understand by looking at the materials around here where the definitions are written clearly

    • Well, it’s a tool to say that in a set like [0, 1), the highest value is 1
      • 1 itself is not included in the set, so it cannot be called the maximum element
  • Real numbers have continuity

    • As an accurate representation of this,
    • If a subset of the set of real numbers is bounded above, it has a least upper bound

    • If it did not have continuity, then when there is a subset that is bounded above, there would be no least upper bound for the subset’s upper bounds
      • Then it would mean that it is not bounded above
      • No, that’s not right (blu3mo)
        • This is not a properly constructed contrapositive
    • But it is indeed natural that “if there is a subset that is bounded above, there exists a least upper bound for the subset’s upper bounds”
      • Is that not right? Even if there are elements in the upper bounds, there may not be a least upper bound
        • For example, in (0, ∞], there are elements but no least upper bound
        • In edge cases, it is the empty set (takker)
          • That’s right (blu3mo)
      • This holds true because it is the essence of what it means to be a real number, so it does not hold in any arbitrary partially ordered set (takker)
        • The upper bound of is (), but there is no least upper bound in
  • Local maximum/minimum

    • It gives the image of being defined by the second derivative, but the definition ” implies ” is indeed a better definition- Flat parts are locally both maximum and minimum (as defined by ≤).
  • Local maximum/Local minimum

    • image
    • Understanding (blu3mo)
    • If we tweak the definition of local maximum a bit, it becomes a global maximum, right? (blu3mo)