DIFFERENTIABILITY - Mathematical Definition

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/general-aptitude-reasoning/calculus/differentiability-and-differentiation/asset-differentiability-mathematical-definition after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware Basics, Network Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a focused lecture on the concept of differentiability in calculus, presented by instructor Yash Jain Sir from Knowledge Gate. The session begins with a formal mathematical definition of differentiability at a specific point, establishing the necessary limit condition. A central theme of the lecture is the logical relationship between differentiability and continuity. The instructor explicitly states that while differentiability guarantees continuity, the reverse is not true. To substantiate this claim, he performs a detailed analysis of the absolute value function, f(x) = |x|, demonstrating through limit calculations that a function can be continuous at a point yet fail to be differentiable due to a sharp corner or cusp. The lecture effectively bridges the gap between abstract definitions and practical application.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with a title card featuring the word CALCULUS surrounded by various mathematical formulas. The instructor, identified as Yash Jain Sir from Knowledge Gate, appears in front of a whiteboard titled Differentiability -> Mathematical Definition. He writes the formal definition: a function f: R -> R is differentiable at x=a if f'(a) exists. He expands this to show the limit definition: lim h->0 [f(a+h) - f(a)] / h must exist. Below this, he lists two critical implications: (1) if a function is differentiable, it is continuous, and (2) if a function is continuous, it is not necessarily differentiable, indicated by a crossed arrow. He underlines x=a and f'(a) to emphasize the point of interest.

  2. 2:00 – 5:00 02:00-05:00

    The instructor moves to a concrete example to illustrate the second point. He writes f(x) = |x| and defines it piecewise as x for x >= 0 and -x for x < 0. He asserts that the function is continuous at x=0 but not differentiable. He sets up the derivative limit at x=0: lim h->0 [f(0+h) - f(0)] / h. He splits this into Left Hand Limit (LHL) and Right Hand Limit (RHL). He calculates the RHL as lim h->0+ h/h = 1 and the LHL as lim h->0- -h/h = -1. He draws a V-shaped graph of |x| on the right side of the board to visualize the sharp corner at the origin.

  3. 5:00 – 5:44 05:00-05:44

    The instructor concludes the proof by highlighting that since the LHL (-1) is not equal to the RHL (1), the limit does not exist, and thus the function is not differentiable at x=0. He writes LHL != RHL in red ink to emphasize the inequality. He also writes LD = RD with a checkmark to show the general condition for differentiability, contrasting it with the current case where LD != RD. He circles the limit expression and the result -1 to draw attention to the specific values. The video concludes with a black screen displaying THANKS FOR WATCHING.

The lecture successfully demystifies the relationship between continuity and differentiability. By starting with the rigorous limit definition and immediately applying it to a classic counterexample, the instructor provides a clear, visual, and mathematical proof that continuity is a prerequisite but not a guarantee for differentiability. The step-by-step calculation of one-sided limits for the absolute value function serves as a practical template for students to analyze other non-differentiable points, reinforcing the concept through calculation of one-sided limits.

Loading lesson…