Area under a nonnegative curve
For a nonnegative Riemann-integrable function, the integral equals geometric area. With signed values, the integral records signed contributions instead of total area. This condition is an editorial clarification.
Animate right-endpoint rectangles, sum their areas and take a limit to introduce the definite integral. Original bilingual notes distinguish finite approximation, integrability and nonnegative geometric area.
The animation begins with area under a curve, partitions [0,1] into equal pieces, takes right-endpoint function values as rectangle heights, and adds the rectangle areas. Increasing the partition count makes the rectangles thinner. The board rewrites the expanded sum in sigma notation, then takes its limit to introduce the definite integral. Editorial scope: the function is Riemann integrable on this interval; continuity is a sufficient condition. A finite rectangle sum usually approximates the integral, while its limit equals the integral exactly under that condition. For a nonnegative function the integral is geometric area; for a signed function it generally differs from total geometric area. The animated 500 is a partition count, not an area value. The source retains an approximation sign before the limit; our notation separates finite approximation from exact equality in the limit. This is an intuitive explanation, not a proof of general convergence or of decreasing error at every increase in partition count.
Generated from the video's visuals and explanation; not verbatim speech.
Start with the blue region: the curve is above the horizontal axis, and the goal is the area between the curve, the axis and the side boundaries. Editorial reminder: equality with geometric area uses a nonnegative function; with negative values, the integral records signed contributions.
Divide the interval into finitely many equal pieces and place a rectangle on each. The illustration uses the function value at the right endpoint as its height, so each area is width times that value.
The animation increases the partition count to illustrate thinner rectangles fitting the curve. 500 counts partitions, not the area answer. A finite visual approximation is not the completed limit.
For an equal partition of [0,1] into n pieces, each width is 1/n and its right endpoint is k/n. This sampling rule determines which function value each rectangle uses.
Write width times height for each rectangle and add the terms. This gives a finite rectangle sum, a genuine finite value that usually differs from the area under the curve.
Sigma notation compresses the repeated terms. Editorial notation names this finite sum S_n and distinguishes it from the target area S. Under integrability, letting the mesh width approach 0 connects the limit to the integral.
Our editorial notation states that the finite sum approximates the integral and the limit equals it exactly. A continuous function is Riemann integrable here. The animation illustrates the idea without proving a convergence theorem for all functions.
The integral bounds come from the original partitioned interval. Refinement makes the right-endpoint grid dense; it does not make a fixed-index sample point approach any arbitrary location. dx is integral notation; the finite width is Δx, and the two are not the same finite number.
For a nonnegative Riemann-integrable function, the integral equals geometric area. With signed values, the integral records signed contributions instead of total area. This condition is an editorial clarification.
Partition the unit interval into n equal pieces. The width is Δx and the right endpoint of piece k is x_k. These symbols are editorial notation for the source construction.
Multiply width by the right-endpoint function value. For a nonnegative function this is the area of the rectangle.
The finite right-endpoint sum is named S_n editorially. Its value approximates the integral; a finite partition need not give exact area.
Under Riemann integrability, the finite sums converge to the integral. Continuity is sufficient. Geometric area additionally requires a nonnegative function.
For a Riemann-integrable function on the unit interval, the limit of these right-endpoint sums equals the integral. This video gives intuition rather than a general proof; continuity is a sufficient editorial condition.
Explore conditions, steps and evidence. Supplementary explanations are labeled separately from content shown in the video.
The curve in the coordinate system is labeled .
Narration paraphrase: The function expression corresponding to a concave-down increasing curve given in the Cartesian coordinate system.
The function expression corresponding to a concave-down increasing curve given in the Cartesian coordinate system.
Shown in the first quadrant, with horizontal coordinates ranging from to .
The right end of the horizontal axis is labeled , the origin is labeled , and the tick mark on the right is labeled .
The variable of the horizontal axis, used to determine the left and right boundaries of the curvilinear trapezoid.
The interval discussed in the diagram is .
The top of the vertical axis is labeled .
The variable of the vertical axis, representing the height of the curve.
No specific numerical range is given in the diagram.
Red text in the upper left corner displays "Number of divisions ", followed by an animation showing .
Narration paraphrase: The number of equal parts into which the interval is divided, also equal to the number of rectangles used to approximate the area.
The number of equal parts into which the interval is divided, also equal to the number of rectangles used to approximate the area.
Visible values start from and eventually reach in the video.
The label f(x) next to the curve in the coordinate system indicates the integrand function curve.
f(x)
The function curve corresponding to the upper boundary of the curvilinear trapezoid.
Shown in the diagram as the graph of a function on the interval from x = 0 to x = 1.
Next to the red slider labeled "Number of divisions", it initially shows n = 500, then changes to n = 6.
Narration paraphrase: The number of equal parts into which the interval [0,1] is divided, i.e., the number of rectangles.
n
The number of equal parts into which the interval [0,1] is divided, i.e., the number of rectangles.
Visible in the diagram as a positive integer; used in the narration to generalize the number of divisions.
On the x-axis, \frac{1}{n}, \frac{2}{n}, \frac{k}{n}, \frac{n-1}{n}, \frac{n}{n} are written sequentially.
Narration paraphrase: The x-coordinate of the k-th partition point, used as the evaluation point for the height of the k-th rectangle.
\frac{k}{n}
The x-coordinate of the k-th partition point, used as the evaluation point for the height of the k-th rectangle.
Used in the diagram according to the order of partition points from left to right; the range of values for k is not explicitly stated in the narration.
The handwritten expression includes \frac{1}{n} as a multiplier.
Narration paraphrase: The width of each small rectangle, i.e., the length of the sub-interval after dividing [0,1] into n equal parts.
\frac{1}{n}
The width of each small rectangle, i.e., the length of the sub-interval after dividing [0,1] into n equal parts.
Applicable to the equal division shown in the diagram.
At the bottom of the screen, \frac{1}{n} f(\frac{1}{n}) + \frac{1}{n} f(\frac{2}{n}) is written.
Narration paraphrase: An expression approximating the area of the curvilinear trapezoid by the sum of several rectangular areas.
By the end of the clip, the summation expression is not yet complete, and the full \sum form does not appear. This refers only to the current analysis segment. Later source content finishes the sum and integral-limit notation, while still not proving general integrability.
\frac{1}{n} f(\frac{1}{n}) + \frac{1}{n} f(\frac{2}{n}) + \cdots
An expression approximating the area of the curvilinear trapezoid by the sum of several rectangular areas.
In the diagram, this applies to the curvilinear trapezoid on [0,1] and the approximation by n equal rectangles.
A black curve in the coordinate system is labeled f(x).
f(x)
The integrand function; in the diagram, it represents the height of the planar curve varying with the horizontal coordinate.
Used in the diagram for approximating and taking the limit of the area under the curve on [0,1].
Red annotation above the graph reads "Number of divisions n = 6".
Points on the horizontal axis are written as 1/n, 2/n, ..., (n-1)/n, n/n=1.
n
The number of equal subdivisions of the interval [0,1]; also determines the number of rectangles. In the example, n=6.
Positive integer; subsequently takes the limit n→∞.
k/n appears on the horizontal axis as a general division point.
The summation is written as Σ_{k=1}^n f(k/n).
The right side writes 1 ≤ k ≤ n.
k
The index of the rectangle or summation term, ranging from 1 to n.
Integer index satisfying 1≤k≤n.
Narration paraphrase: The video first poses a geometric problem: find the area of the curvilinear trapezoid enclosed by the curve , two vertical lines and , and the -axis. The screen fills this region with light blue to visualize the "area object".
The diagram shows the region enclosed by the curve , the vertical line , the vertical line , and the -axis.
Starting around 19 seconds, this region is filled with light blue.
The video first poses a geometric problem: find the area of the curvilinear trapezoid enclosed by the curve , two vertical lines and , and the -axis. The screen fills this region with light blue to visualize the "area object".
The curve is denoted as
Left and right boundaries are and
Lower boundary is the horizontal -axis
The goal is the area of this closed region
Editorial scope for integral and area conclusions: the function is Riemann integrable on[0,1]; continuity suffices, and geometric-area interpretation also requires nonnegativity. Finite sums usually approximate, while the limit equals the integral exactly. A finite animation is not a general proof or an error-monotonicity theorem.
Narration paraphrase: The approximation method presented in the video is: divide the interval into equal parts, construct a rectangle on each sub-interval, and use the sum of the areas of these rectangles to approximate the area of the curvilinear trapezoid. In the example, , resulting in 6 equal-width rectangles.
The light blue region is divided into 6 equal-width rectangles, with "Number of divisions " labeled in the upper left corner.
A green cursor points to each rectangle sequentially.
The approximation method presented in the video is: divide the interval into equal parts, construct a rectangle on each sub-interval, and use the sum of the areas of these rectangles to approximate the area of the curvilinear trapezoid. In the example, , resulting in 6 equal-width rectangles.
Interval is
Divided into equal-width sub-intervals
Sum of rectangle areas approximates the target area
Editorial scope for integral and area conclusions: the function is Riemann integrable on[0,1]; continuity suffices, and geometric-area interpretation also requires nonnegativity. Finite sums usually approximate, while the limit equals the integral exactly. A finite animation is not a general proof or an error-monotonicity theorem.
Narration paraphrase: The video explicitly states that rectangle approximation does not equal the true area; there is an error. The error comes from the small regions left between the top edges of the rectangles and the curve. The instructor refers to these small blocks as "the sum of the areas of curvilinear triangles".
Small gaps remain between the tops of the rectangles and the curve.
The video explicitly states that rectangle approximation does not equal the true area; there is an error. The error comes from the small regions left between the top edges of the rectangles and the curve. The instructor refers to these small blocks as "the sum of the areas of curvilinear triangles".
When using a finite number of rectangles for approximation
Rectangles do not completely coincide with the curve
Editorial scope for integral and area conclusions: the function is Riemann integrable on[0,1]; continuity suffices, and geometric-area interpretation also requires nonnegativity. Finite sums usually approximate, while the limit equals the integral exactly. A finite animation is not a general proof or an error-monotonicity theorem.
Narration paraphrase: The video establishes the core intuition through verbal guidance: when the number of divisions increases from 6 to 10, 100, 1000, the rectangles become finer and denser, the top error becomes smaller, and thus the sum of rectangle areas gets closer and closer to the area of the curvilinear trapezoid.
Subsequently enters an animation demonstration of increasing .
The video establishes the core intuition through verbal guidance: when the number of divisions increases from 6 to 10, 100, 1000, the rectangles become finer and denser, the top error becomes smaller, and thus the sum of rectangle areas gets closer and closer to the area of the curvilinear trapezoid. Editorial clarification: this describes the trend in the source animation, not a general error-monotonicity conclusion.
Keep interval unchanged
Continuously increase the number of equal divisions
Editorial scope for integral and area conclusions: the function is Riemann integrable on[0,1]; continuity suffices, and geometric-area interpretation also requires nonnegativity. Finite sums usually approximate, while the limit equals the integral exactly. A finite animation is not a general proof or an error-monotonicity theorem.
The blue region below the curve f(x), above the x-axis, and between x=0 and x=1 in the coordinate system is represented as the area to be calculated.
Narration paraphrase: The video uses the blue region bounded by the x-axis, the line x=0, the line x=1, and the curve f(x) to illustrate the geometric object of the definite integral: it represents the area under the curve on the given interval. Subsequently, this area is approximated by cutting the region into many small rectangles and summing them.
The video uses the blue region bounded by the x-axis, the line x=0, the line x=1, and the curve f(x) to illustrate the geometric object of the definite integral: it represents the area under the curve on the given interval. Subsequently, this area is approximated by cutting the region into many small rectangles and summing them.
The interval of study is [0,1].
The curve f(x) lies above the x-axis, and the region in the diagram is a curvilinear trapezoid.
Editorial scope for integral and area conclusions: the function is Riemann integrable on[0,1]; continuity suffices, and geometric-area interpretation also requires nonnegativity. Finite sums usually approximate, while the limit equals the integral exactly. A finite animation is not a general proof or an error-monotonicity theorem.
Narration paraphrase: The video denotes the general number of divisions as n and divides the interval [0,1] equally into n sub-intervals. The x-coordinates of the partition points are sequentially \frac{1}{n}, \frac{2}{n}, \ldots, \frac{k}{n}, \ldots, \frac{n-1}{n}, \frac{n}{n}, where \frac{n}{n}=1. The width of each sub-interval is \frac{1}{n}.
On the x-axis, \frac{1}{n}, \frac{2}{n}, \frac{k}{n}, \frac{n-1}{n}, \frac{n}{n} are labeled sequentially.
The video denotes the general number of divisions as n and divides the interval [0,1] equally into n sub-intervals. The x-coordinates of the partition points are sequentially \frac{1}{n}, \frac{2}{n}, \ldots, \frac{k}{n}, \ldots, \frac{n-1}{n}, \frac{n}{n}, where \frac{n}{n}=1. The width of each sub-interval is \frac{1}{n}.
The interval is [0,1].
The division method is equal division into n parts.
Editorial scope for integral and area conclusions: the function is Riemann integrable on[0,1]; continuity suffices, and geometric-area interpretation also requires nonnegativity. Finite sums usually approximate, while the limit equals the integral exactly. A finite animation is not a general proof or an error-monotonicity theorem.
Narration paraphrase: The video writes the area of each small rectangle as "width times height." For the first rectangle, the width is \frac{1}{n}, and the height takes the function value of the curve at the partition point f(\frac{1}{n}), so the area is \frac{1}{n} f(\frac{1}{n}). Similarly, the second rectangle is \frac{1}{n} f(\frac{2}{n}).
At the bottom of the screen, \frac{1}{n} f(\frac{1}{n}) is written.
The video writes the area of each small rectangle as "width times height." For the first rectangle, the width is \frac{1}{n}, and the height takes the function value of the curve at the partition point f(\frac{1}{n}), so the area is \frac{1}{n} f(\frac{1}{n}). Similarly, the second rectangle is \frac{1}{n} f(\frac{2}{n}).
The interval [0,1] is divided equally into n parts.
The height of the rectangle takes the function value at the corresponding partition point as shown in the diagram.
Editorial scope for integral and area conclusions: the function is Riemann integrable on[0,1]; continuity suffices, and geometric-area interpretation also requires nonnegativity. Finite sums usually approximate, while the limit equals the integral exactly. A finite animation is not a general proof or an error-monotonicity theorem.
Narration paraphrase: The video sums the areas of individual small rectangles term by term, using the total area of the rectangles to approximate the area of the curvilinear trapezoid. The first two terms \frac{1}{n} f(\frac{1}{n}) + \frac{1}{n} f(\frac{2}{n}) are explicitly written in the clip, and it is explained that the width of each term is \frac{1}{n}.
At the bottom of the screen, \frac{1}{n} f(\frac{1}{n}) + \frac{1}{n} f(\frac{2}{n}) is written, and writing continues until the end of the clip.
The complete summation expression is not finished within the clip, and the \sum_{k=1}^{n} form is not seen. This refers only to the current analysis segment. Later source content finishes the sum and integral-limit notation, while still not proving general integrability.
The video sums the areas of individual small rectangles term by term, using the total area of the rectangles to approximate the area of the curvilinear trapezoid. The first two terms \frac{1}{n} f(\frac{1}{n}) + \frac{1}{n} f(\frac{2}{n}) are explicitly written in the clip, and it is explained that the width of each term is \frac{1}{n}.
Using equal-division rectangles to approximate the area under the curve.
The objects of summation are the areas of the small rectangles.
Editorial scope for integral and area conclusions: the function is Riemann integrable on[0,1]; continuity suffices, and geometric-area interpretation also requires nonnegativity. Finite sums usually approximate, while the limit equals the integral exactly. A finite animation is not a general proof or an error-monotonicity theorem.
The diagram divides [0,1] into several sub-intervals and uses blue rectangles to approximate the area under the curve.
The bottom writes (1/n)f(1/n)+(1/n)f(2/n)+...+(1/n)f(n/n).
Narration paraphrase: First, divide the interval [0,1] into n equal parts, each with width 1/n; the k-th small rectangle takes the function value f(k/n) at the right endpoint k/n as its height, so the area approximation equals the sum of the areas of all small rectangles.
First, divide the interval [0,1] into n equal parts, each with width 1/n; the k-th small rectangle takes the function value f(k/n) at the right endpoint k/n as its height, so the area approximation equals the sum of the areas of all small rectangles.
The interval is [0,1].
Divided into n equal parts.
Each rectangle's height is taken as the function value at the right endpoint.
Editorial scope for integral and area conclusions: the function is Riemann integrable on[0,1]; continuity suffices, and geometric-area interpretation also requires nonnegativity. Finite sums usually approximate, while the limit equals the integral exactly. A finite animation is not a general proof or an error-monotonicity theorem.
The bottom rewrites the expanded form as (1/n)Σ_{k=1}^n f(k/n).
Narration paraphrase: Compresses the term-by-term addition of area approximations into a summation expression with index k, where 1/n is the common width and f(k/n) is the height of the k-th rectangle.
Compresses the term-by-term addition of area approximations into a summation expression with index k, where 1/n is the common width and f(k/n) is the height of the k-th rectangle.
k is an integer index.
The summation range is k=1 to n.
Editorial scope for integral and area conclusions: the function is Riemann integrable on[0,1]; continuity suffices, and geometric-area interpretation also requires nonnegativity. Finite sums usually approximate, while the limit equals the integral exactly. A finite animation is not a general proof or an error-monotonicity theorem.
The bottom first writes S≈[...].
Narration paraphrase: When n is fixed, the total area of the rectangles is usually not equal to the area under the curve, so the video uses the approximately equal sign instead of the equals sign.
When n is fixed, the total area of the rectangles is usually not equal to the area under the curve, so the video uses the approximately equal sign instead of the equals sign.
n is a finite value.
The limit has not yet been taken.
Editorial scope for integral and area conclusions: the function is Riemann integrable on[0,1]; continuity suffices, and geometric-area interpretation also requires nonnegativity. Finite sums usually approximate, while the limit equals the integral exactly. A finite animation is not a general proof or an error-monotonicity theorem.
The bottom continues to write lim_{n→∞}[...] = lim_{n→∞}(1/n)Σ_{k=1}^n f(k/n) = ∫_0^1 f(x)dx.
Narration paraphrase: Let the number of divisions n approach infinity, making the width of each small rectangle approach 0; the limit of the rectangular sum is the exact value of the area under the curve, which is the definite integral.
The final source board still writes S approximately equal to a limit. Editorial notation separates finite approximation from exact equality of the limit, integral and area under the stated conditions; the corrected sign is not attributed to the source board.
Let the number of divisions n approach infinity, making the width of each small rectangle approach 0; the limit of the rectangular sum is the exact value of the area under the curve, which is the definite integral.
Take the limit n→∞ of the rectangular sum.
The integration interval is [0,1].
Editorial scope for integral and area conclusions: the function is Riemann integrable on[0,1]; continuity suffices, and geometric-area interpretation also requires nonnegativity. Finite sums usually approximate, while the limit equals the integral exactly. A finite animation is not a general proof or an error-monotonicity theorem.
Narration paraphrase: On, form equal-width right-endpoint rectangle sums for. Under Riemann integrability, as positive integer tends to infinity, these sums converge to the integral; for a nonnegative function the integral equals geometric area. This asserts vanishing error, rather than decreasing error at every increase in partition count.
During the process of increasing from 6 to 500, the gaps between the tops of the rectangles and the curve gradually shrink.
The video does not write out formal limit symbols or complete definitions, only providing geometric intuition. This refers only to the current analysis segment. Later source content finishes the sum and integral-limit notation, while still not proving general integrability.
On, form equal-width right-endpoint rectangle sums for. Under Riemann integrability, as positive integer tends to infinity, these sums converge to the integral; for a nonnegative function the integral equals geometric area. This asserts vanishing error, rather than decreasing error at every increase in partition count.
Consider the region enclosed by curve , , , and the -axis
Divide equally into parts
Use the sum of corresponding rectangle areas as an approximation
Editorial scope for integral and area conclusions: the function is Riemann integrable on[0,1]; continuity suffices, and geometric-area interpretation also requires nonnegativity. Finite sums usually approximate, while the limit equals the integral exactly. A finite animation is not a general proof or an error-monotonicity theorem.
Holds for positive integer division numbers that continuously increase; expressed via intuitive demonstration rather than formal proof in the video.
Narration paraphrase: The limit of the rectangle sums equals the target area, rather than a finite expression containing infinitely many actual rectangles. Editorial scope requires Riemann integrability and nonnegativity; continuity is sufficient for integrability.
When n=500, the blue region shows almost no trace of division, then switches back to the obvious rectangular division with n=6.
The formal limit symbol \lim_{n\to\infty} is not written in the video. This refers only to the current analysis segment. Later source content finishes the sum and integral-limit notation, while still not proving general integrability.
The limit of the rectangle sums equals the target area, rather than a finite expression containing infinitely many actual rectangles. Editorial scope requires Riemann integrability and nonnegativity; continuity is sufficient for integrability.
The interval [0,1] is divided equally into n parts.
The sum of rectangular areas is used to approximate the area of the curvilinear trapezoid.
Editorial scope for integral and area conclusions: the function is Riemann integrable on[0,1]; continuity suffices, and geometric-area interpretation also requires nonnegativity. Finite sums usually approximate, while the limit equals the integral exactly. A finite animation is not a general proof or an error-monotonicity theorem.
Limit process where n approaches infinity.
Narration paraphrase: The video summarizes the construction idea of the definite integral as: using the summation process of a finite number of rectangles to approximate and simulate the area under infinite subdivision.
The video summarizes the construction idea of the definite integral as: using the summation process of a finite number of rectangles to approximate and simulate the area under infinite subdivision.
There exists a sum of rectangles obtained from finite division.
Consider the process where the number of divisions constantly increases.
General statement, no formal quantifiers given.
The right side writes 1≤k≤n, then writes 1/n≤k/n≤1.
Narration paraphrase: For each partition count n, the right-endpoint grid consists of k/n with1≤k≤n, a finite discrete set in the original interval[0,1]. As mesh width1/n tends to0, these grids become dense. Integral bounds come from the originally partitioned interval, not from a fixed k making k/n approach arbitrary positions.
The video uses intuitive language to explain how the endpoints change from 1/n to 1 becoming 0 to 1 as n→∞, without expanding into a rigorous limit argument.
For each partition count n, the right-endpoint grid consists of k/n with1≤k≤n, a finite discrete set in the original interval[0,1]. As mesh width1/n tends to0, these grids become dense. Integral bounds come from the originally partitioned interval, not from a fixed k making k/n approach arbitrary positions.
k is an integer and 1≤k≤n.
Take the limit n→∞.
For all integers k satisfying 1≤k≤n, consider the limit process n→∞.
Narration paraphrase: The source gives an intuitive notation correspondence: finite width1/n corresponds to integral notation dx, sample k/n to variable x, and the original bounds are0 to1. Editorial clarification: this is not the finite-number equality dx=1/n, nor does every fixed k/n become the same continuous limit variable.
The final expression is ∫_0^1 f(x)dx.
The source gives an intuitive notation correspondence: finite width1/n corresponds to integral notation dx, sample k/n to variable x, and the original bounds are0 to1. Editorial clarification: this is not the finite-number equality dx=1/n, nor does every fixed k/n become the same continuous limit variable.
The correspondence lim_{n→∞}(1/n)Σ_{k=1}^n f(k/n)=∫_0^1 f(x)dx has been established.
Term-by-term correspondence for the summation and integral expressions in this example.
Narration paraphrase: The video uses geometric intuition to explain: as the number of divisions increases, the rectangle approximation error tends to decrease, and the sum of rectangle areas approaches the true area of the curvilinear trapezoid.
The number of rectangles gradually increases, and the top gaps gradually shrink.
The video does not write out summation formulas or limit formulas; the derivation belongs to intuitive demonstration. This refers only to the current analysis segment. Later source content finishes the sum and integral-limit notation, while still not proving general integrability.
First determine the goal: find the area of the curvilinear trapezoid enclosed by curve , , , and the -axis.
From the opening problem statement and graphical boundaries.
Divide the interval equally into 6 parts, construct 6 equal-width rectangles, and use the sum of rectangle areas to approximate the target area.
The instructor explicitly says "divided into six equal parts... created six rectangles... approximated the curvilinear trapezoid".
Point out that approximation has errors, and the errors come from the small regions between the top of the rectangles and the curve.
The instructor says "definitely has errors... the error is the sum of the areas of these curvilinear triangles above".
Imagine continuing to increase the number of equal divisions to 10, 100, 1000, making the rectangles finer and the error smaller.
The instructor introduces the trend judgment with "if I divide into ten, one hundred, one thousand".
In the animation, let continuously increase from 6 to 500; visually, the gaps at the top of the rectangles keep shrinking, indicating that the sum of rectangle areas gets closer and closer to the area of the curvilinear trapezoid.
The screen shows increasing and the region being filled by denser rectangles; the instructor simultaneously says "dividing finer and finer, the errors above become smaller and smaller".
The animation illustrates the intuitive trend of rectangle sums approaching area as the partition count increases. Editorial clarification: Riemann integrability ensures convergence as the mesh tends to zero, and nonnegativity supports the geometric-area interpretation. The animation is not a general convergence proof or a theorem that error decreases at every increase in partition count.
Narration paraphrase: The video establishes an intuitive derivation of approximating the area under the curve with a sum of rectangles through equal division of the interval, taking rectangle width and height, and summing term by term.
The screen sequentially writes out the x-axis partition points and \frac{1}{n} f(\frac{1}{n}) + \frac{1}{n} f(\frac{2}{n}).
The derivation is incomplete at the end of the clip, and the full summation symbol is not written. This refers only to the current analysis segment. Later source content finishes the sum and integral-limit notation, while still not proving general integrability.
First, divide [0,1] equally into n parts to obtain the x-coordinates of each partition point.
The video explicitly states "since it is an average division" and marks these positions one by one.
The distance between adjacent partition points is the same, so the width of each small rectangle is \frac{1}{n}. Editorial notation denotes this finite width by Δx.
The narrator says, "actually the width of every rectangle is one over n."
The height of the first rectangle takes the function value of the curve at the x-coordinate \frac{1}{n}. Editorial notation names the first rectangle height H_1.
The narrator says, "how is the length calculated? f(one over n), because this x-coordinate is one over n, substitute it into the function value."
The area of the first rectangle equals width times height.
Direct multiplication of the height and width obtained from the previous step based on the rectangle area formula.
The area of the second rectangle is similar to the first, except the height is changed to f(\frac{2}{n}).
The narrator says, "calculate the second one similarly, it becomes f(two over n)," and continues writing the addition term.
Add up the areas of all small rectangles to get the approximate sum of the area of the curvilinear trapezoid.
The narrator says, "then let's add up all these areas."
The video establishes an intuitive derivation of approximating the area under the curve with a sum of rectangles through equal division of the interval, taking rectangle width and height, and summing term by term.
At the beginning, when n=500, the blue region appears almost continuous; about 14 seconds later, it switches to n=6, where 6 light blue rectangles can be clearly seen.
Narration paraphrase: Through the comparison of n=500 and n=6, the video first shows the result of "subdivision to near continuity," then returns to observable finite division, helping to understand how the sum of rectangles approximates the area.
In the screen, the number of divisions is large, the rectangle boundaries are almost invisible, and the blue region looks like a single curvilinear trapezoid.
Directly visible animation state.
The screen switches back to a state with a smaller number of divisions, where 6 rectangles are clearly distinguishable, facilitating observation of the structure of "rectangles approximating the area under the curve."
Directly visible animation switch and the narrator's explanation of "going back to the original animation."
Through the comparison of n=500 and n=6, the video first shows the result of "subdivision to near continuity," then returns to observable finite division, helping to understand how the sum of rectangles approximates the area.
The bottom sequentially writes the expanded sum, summation symbol, approximation, limit, and definite integral.
Narration paraphrase: The area S of the region under the curve can be represented by the limit of the right-endpoint Riemann sum as ∫_0^1 f(x)dx, which is the geometric meaning of the definite integral demonstrated in this segment. Editorial scope for integral and area conclusions: the function is Riemann integrable on[0,1]; continuity suffices, and geometric-area interpretation also requires nonnegativity. Finite sums usually approximate, while the limit equals the integral exactly. A finite animation is not a general proof or an error-monotonicity theorem.
Blue rectangles in the diagram continuously approximate the area under the curve, providing the geometric background for the derivation.
The video does not prove that the limit necessarily exists, nor does it discuss the integrability conditions of f; it provides a definitional derivation within an intuitive geometric context.
The final source approximation sign is still linked to the limit; editorial notation separates finite approximation from exact equality in the limit.
First establish the partition and determine the width of each small rectangle.
The horizontal axis in the diagram marks 1/n,2/n,...,n/n=1, and the narration calls n the "number of divisions".
Write the area of each small rectangle as "width × height" and add them term by term.
The narration points out term by term that the second rectangle has height f(2/n) and writes up to the last term f(n/n).
Compress the expanded form into summation notation.
The narration explicitly states it can be written in "sigma summation form, k from one to n".
Explain that a finite number of rectangles only approximates the area S, rather than being exactly equal.
The narration says "this is only an approximate calculation, our S can only be approximately equal to it".
To turn the approximation into an exact value, take the limit n→∞ of the rectangular sum.
The narration asks "when can it be exactly equal?" and answers "I can take a limit".
Denote this limit as the definite integral.
The narration says "after taking this limit, it becomes the so-called definite integral".
Editorial clarification: the sample grid is a discrete subset of the original interval; refinement sends the mesh width to0. Integral bounds come from the original partitioned interval, rather than one fixed-index point covering the interval.
The right-side board writing shows 1≤k≤n and 1/n≤k/n≤1, and the narration says it becomes 0 to 1 when n→∞.
Explain how quantities in the summation correspond to quantities in the integral notation. Editorial clarification: this is a notation correspondence, not equality of dx with a finite width.
The narration explicitly says "one divided by n is written as dx, k/n is written as x".
The area S of the region under the curve can be represented by the limit of the right-endpoint Riemann sum as ∫_0^1 f(x)dx, which is the geometric meaning of the definite integral demonstrated in this segment. Editorial scope for integral and area conclusions: the function is Riemann integrable on[0,1]; continuity suffices, and geometric-area interpretation also requires nonnegativity. Finite sums usually approximate, while the limit equals the integral exactly. A finite animation is not a general proof or an error-monotonicity theorem.
The screen displays "Number of divisions ", and the curvilinear trapezoid is approximated by 6 equal-width rectangles.
Narration paraphrase: In the curvilinear trapezoid enclosed by curve , , , and the -axis, approximate its area using 6 equal-width rectangles.
The video does not give the specific analytical expression of , nor does it calculate the numerical area. This refers only to the current analysis segment. Later source content finishes the sum and integral-limit notation, while still not proving general integrability.
In the curvilinear trapezoid enclosed by curve , , , and the -axis, approximate its area using 6 equal-width rectangles.
Interval is
Number of divisions
Curve is denoted as
Demonstrate how to approximate the area of the curvilinear trapezoid using the sum of rectangle areas, and point out where the error lies.
Divide equally into 6 parts.
The instructor explicitly says "divided into six equal parts".
Construct a rectangle on each sub-interval, obtaining 6 rectangles in total.
The screen shows 6 equal-width rectangles covering the lower part of the original region.
Add up the areas of these 6 rectangles as an approximation of the curvilinear trapezoid's area.
The instructor says "the sum of the areas of these six rectangles can approximate the curvilinear trapezoid".
Observe the small gaps between the tops of the rectangles and the curve to identify the approximation error.
The instructor says "the error is the sum of the areas of these curvilinear triangles above".
The video provides the approximation construction and error identification, without giving a specific numerical answer.
By comparing the total area of the rectangles with the light blue curvilinear trapezoid region, it is visible that the rectangle sum is only an approximation, with gaps remaining at the top.
White background title page displays "Geometric Meaning of Definite Integral" in the center.
Narration paraphrase: The opening directly points out that this section discusses the geometric meaning of the definite integral.
Title text "Geometric Meaning of Definite Integral"
Course and account information at the top
Screen statically displays the theme
Theme is the content of this section: geometric meaning of definite integral
The opening directly points out that this section discusses the geometric meaning of the definite integral.
Cartesian coordinate system appears, along with curve , vertical line , and origin .
Starting around 19 seconds, the region under the curve is filled with light blue.
Coordinate axes ,
Curve
Vertical lines and
Light blue filled region
First display curve and boundaries, then color the enclosed region
Interval is always
Target region is always the closed figure between the curve and the -axis
The light blue region is the curvilinear trapezoid area object mentioned by the instructor.
Upper left corner displays "Number of divisions ", and the light blue region is approximated by 6 equal-width rectangles.
Green cursor points to different rectangles and their top gaps sequentially.
6 equal-width rectangles
Curve
Gaps between rectangle tops and the curve
Switch from overall colored region to 6-rectangle approximation
Cursor points to rectangles and error locations individually
Interval remains
Rectangle widths are equal
This step concretizes "approximation substitution" into the summation of a finite number of rectangles and makes the error visible.
in the upper left corner gradually increases from 6, passing through 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120, 122, 124, 126, 128, 130, 132, 134, 136, 138, 140, 142, 144, 146, 148, 150, 152, 154, 156, 158, 160, 162, 164, 166, 168, 170, 172, 174, 176, 178, 180, 182, 184, 186, 188, 190, 192, 194, 196, 198, 200, 202, 204, 206, 208, 210, 212, 214, 216, 218, 220, 222, 224, 226, 228, 230, 232, 234, 236, 238, 240, 242, 244, 246, 248, 250, 252, 254, 256, 258, 260, 262, 264, 266, 268, 270, 272, 274, 276, 278, 280, 282, 284, 286, 288, 290, 292, 294, 296, 298, 300, 302, 304, 306, 308, 310, 312, 314, 316, 318, 320, 322, 324, 326, 328, 330, 332, 334, 336, 338, 340, 342, 344, 346, 348, 350, 352, 354, 356, 358, 360, 362, 364, 366, 368, 370, 372, 374, 376, 378, 380, 382, 384, 386, 388, 390, 392, 394, 396, 398, 400, 402, 404, 406, 408, 410, 412, 414, 416, 418, 420, 422, 424, 426, 428, 430, 432, 434, 436, 438, 440, 442, 444, 446, 448, 450, 452, 454, 456, 458, 460, 462, 464, 466, 468, 470, 472, 474, 476, 478, 480, 482, 484, 486, 488, 490, 492, 494, 496, 498, 500.
Narration paraphrase: The animation visualizes the limit idea of "increasing to make approximation better": the denser the rectangles, the smaller the error, and the closer the area sum to the true area.
Constantly increasing equal-width rectangles
Curve
Gradually shrinking top gaps
Red value label
Number of rectangles continuously increases
Width of individual rectangles continuously narrows
Gaps between rectangle tops and the curve continuously shrink
Overall blue filling increasingly fits the true curvilinear trapezoid
Interval is always
Curve shape remains unchanged
Approximation idea is always the sum of rectangle areas
The animation visualizes the limit idea of "increasing to make approximation better": the denser the rectangles, the smaller the error, and the closer the area sum to the true area.
In the coordinate system, below the curve f(x) and between x=0 and x=1 is a solid dark blue region, with a red slider labeled "Number of divisions n = 500."
Narration paraphrase: When the number of divisions is large, the rectangle boundaries visually disappear almost completely, indicating that the sum of rectangles is already very close to the area of the curvilinear trapezoid.
Coordinate axes x,y
Curve f(x)
Blue filled region
Red slider
Label n = 500
Green cursor moves within the blue region.
Red slider stays at the position n=500.
Interval endpoints remain 0 and 1.
Shape of curve f(x) remains unchanged.
Blue region always represents the area under the curve.
When the number of divisions is large, the rectangle boundaries visually disappear almost completely, indicating that the sum of rectangles is already very close to the area of the curvilinear trapezoid.
The screen switches from the continuous blue region of n=500 to 6 light blue rectangles of n=6, whose tops form a staircase shape close to the curve f(x).
Narration paraphrase: A smaller n makes the division structure visible, facilitating the translation of "area approximation" into specific rectangular summation.
6 light blue rectangles
Curve f(x)
Red slider
Label n = 6
Red slider moves from right to left.
Filled region changes from a single blue block to 6 distinguishable rectangles.
Curve f(x) remains unchanged.
Interval remains [0,1].
Rectangles are still used to approximate the area under the curve.
A smaller n makes the division structure visible, facilitating the translation of "area approximation" into specific rectangular summation.
After the page switches, red partition point labels \frac{1}{n}, \frac{2}{n}, \frac{k}{n}, \frac{n-1}{n}, \frac{n}{n} appear sequentially below the x-axis, and 1 is written next to \frac{n}{n}.
Narration paraphrase: This step symbolizes the equal division structure in the graphic, preparing for writing the width and height of each rectangle later.
x-axis
Red partition point labels
6 rectangles
Curve f(x)
Partition point labels are added sequentially from left to right on the x-axis.
Finally, \frac{n}{n} is associated with 1.
Number of rectangles and shape of curve remain unchanged.
Right endpoint of the interval remains 1.
This step symbolizes the equal division structure in the graphic, preparing for writing the width and height of each rectangle later.
At the bottom left of the screen, \frac{1}{n} f(\frac{1}{n}) is written first, then continued as \frac{1}{n} f(\frac{1}{n}) + \frac{1}{n} f(\frac{2}{n}).
Narration paraphrase: The animation directly transcribes geometric rectangles into algebraic terms, showing that "adding areas" means accumulating these \frac{1}{n} f(\cdot) terms.
By the end of the clip, the summation expression has not been continued to its complete form. This refers only to the current analysis segment. Later source content finishes the sum and integral-limit notation, while still not proving general integrability.
Handwritten formula \frac{1}{n} f(\frac{1}{n}) + \frac{1}{n} f(\frac{2}{n})
First rectangle
Second rectangle
x-axis partition point labels
Formula is written term by term from nothing.
Green cursor points to the first rectangle and the corresponding partition point.
Width of each rectangle remains \frac{1}{n}.
Height still takes the f value at the corresponding partition point.
The animation directly transcribes geometric rectangles into algebraic terms, showing that "adding areas" means accumulating these \frac{1}{n} f(\cdot) terms.
The main visual is always the Cartesian coordinate system, the black curve f(x), blue rectangles, and red handwritten formulas.
A green dot moves along the formula, indicating the term currently being explained.
Coordinate axes x, y
Curve f(x)
Six blue rectangles
Horizontal axis division points 1/n,2/n,...,(n-1)/n,n/n=1
Red handwritten formulas
Green indicator dot
The green indicator dot sequentially points to different rectangle heights and different terms in the formula.
The bottom formula is gradually completed: first the expanded sum, then the summation symbol, then the approximation, limit, and integral.
The right side later adds explanations for 1≤k≤n, 1/n≤k/n≤1, n→∞, and 0, 1.
The shape of the curve and the six example rectangles in the main diagram remain unchanged.
The discussion interval always corresponds to 0 to 1 on the horizontal axis.
The visual core is using the rectangular sum with a fixed example n=6, combined with step-by-step written formulas, to demonstrate the process of "finite approximation → taking limit → definite integral".
The screen switches to a course catalog page with a white background and red/black text.
Narration paraphrase: This segment is channel promotion and a course list, containing no new mathematical content.
Two columns of red course titles
Top text "Basic Class Bilibili: Xinyi Senior WeChat Official Account: xinyixuezhang"
Bottom text "For more useful content, please follow Bilibili: Xinyi Senior"
The mathematical derivation screen disappears, replaced by a pure text catalog page.
No new formulas or graphical derivations appear.
This segment is channel promotion and a course list, containing no new mathematical content.
Narration paraphrase: The video emphasizes that this is only "approximation substitution"; as long as the number of divisions is finite, there are still errors between the tops of the rectangles and the curve.
After seeing rectangles fill the region, one might mistakenly think the sum of rectangle areas already equals the area of the curvilinear trapezoid.
For the nonconstant increasing positive curve shown here, the right-endpoint rectangle sum is a finite approximation with error. Editorial clarification: for other functions, a finite rectangle sum may equal the integral exactly; the error in this illustration is not inevitable for every finite partition.
Narration paraphrase: The video points out that the error lies in the small regions between the top edge of each rectangle and the curve; the sum of the areas of these small blocks constitutes the total error.
Several small gaps are visible between the tops of the rectangles and the curve.
"Curvilinear triangle" is the instructor's intuitive term; the video does not provide a stricter definition. This refers only to the current analysis segment. Later source content finishes the sum and integral-limit notation, while still not proving general integrability.
Focusing only on the total number of rectangles while ignoring where the error actually occurs.
The video points out that the error lies in the small regions between the top edge of each rectangle and the curve; the sum of the areas of these small blocks constitutes the total error.
Narration paraphrase: The video emphasizes: with finite n, it is only "close"; only in the limit process where n approaches infinity is it said to be "completely equal."
When n is large, the graphic looks like a single continuous region, making it easy to mistakenly think that the sum of rectangles from finite division is already equal to the area under the curve.
The right-endpoint rectangles for the nonconstant increasing positive curve illustrate why an apparently continuous picture does not make this finite approximation exact. Editorial clarification: finite sums can sometimes be exact. For a Riemann-integrable function, sums converge to the integral as the partition mesh tends to zero; nonnegativity is needed to interpret that integral directly as geometric area.
First writes S≈[...], then only writes the equals sign to the integral after taking the limit.
Narration paraphrase: A finite rectangle sum usually differs from the exact integral, although particular functions and sampling rules can give equality even with a finite partition. The standard result is that the limit equals the integral under Riemann integrability, and geometric area for a nonnegative function. These scope and special-case reminders are editorial.
When seeing the rectangular sum formula, one might easily think S is exactly equal to (1/n)Σ f(k/n).
A finite rectangle sum usually differs from the exact integral, although particular functions and sampling rules can give equality even with a finite partition. The standard result is that the limit equals the integral under Riemann integrability, and geometric area for a nonnegative function. These scope and special-case reminders are editorial.
The right side specifically writes 1≤k≤n and 1/n≤k/n≤1.
Narration paraphrase: The video explains that this is because the sample points k/n lie in [1/n,1] under 1≤k≤n, and as n→∞, the overall range tends to [0,1]. Editorial clarification: bounds come from the original interval. The mesh tends to0 and sample grids become dense; this does not make a fixed-index point traverse the interval.
One might easily just memorize ∫_0^1 without understanding why the interval is 0 to 1.
The video explains that this is because the sample points k/n lie in [1/n,1] under 1≤k≤n, and as n→∞, the overall range tends to [0,1]. Editorial clarification: bounds come from the original interval. The mesh tends to0 and sample grids become dense; this does not make a fixed-index point traverse the interval.
Narration paraphrase: The rectangle approximation method is introduced to solve the problem of calculating the area of the curvilinear trapezoid.
The rectangle approximation method is introduced to solve the problem of calculating the area of the curvilinear trapezoid.
Narration paraphrase: Finite rectangle approximation inherently contains error; error is an intrinsic component of this method.
The right-endpoint rectangle approximation for the nonconstant increasing positive curve shown here has error. Editorial clarification: error is not inevitable in every finite rectangle sum; other functions may give exact equality for a finite partition.
Narration paraphrase: By observing the trend that error decreases as increases, the video generalizes finite approximation to the limit idea of "getting closer and closer to the true area".
By observing the trend that error decreases as increases, the video generalizes finite approximation to the limit idea of "getting closer and closer to the true area".
The animation of increasing directly supports the judgment that "error becomes smaller and smaller, area sum gets closer and closer to true area".
The proposition about "increasing divisions makes approximation closer to true area" depends on the prerequisite concepts of rectangle approximation and error analysis.
Narration paraphrase: To express the geometric object of the curvilinear trapezoid area in mathematical language, the video first performs n equal division on the interval [0,1].
Transition from the blue area diagram to the rectangular diagram with partition point labels.
To express the geometric object of the curvilinear trapezoid area in mathematical language, the video first performs n equal division on the interval [0,1].
Narration paraphrase: Only by knowing the partition points after equal division and the width \frac{1}{n} of each sub-interval can one write the height and area of each rectangle.
Partition points \frac{1}{n}, \frac{2}{n} appear directly in \frac{1}{n} f(\frac{1}{n}), \frac{1}{n} f(\frac{2}{n}).
Only by knowing the partition points after equal division and the width \frac{1}{n} of each sub-interval can one write the height and area of each rectangle.
Narration paraphrase: The sum of rectangular areas consists of individual rectangular area terms, and the summation method contains the application of the single rectangle area formula.
Expands from the single term \frac{1}{n} f(\frac{1}{n}) to \frac{1}{n} f(\frac{1}{n}) + \frac{1}{n} f(\frac{2}{n}).
The sum of rectangular areas consists of individual rectangular area terms, and the summation method contains the application of the single rectangle area formula.
Narration paraphrase: The video generalizes the approximation idea of finite-term rectangular sums to the limit case of n\to\infty, thereby obtaining the conclusion that the area is "completely equal."
The nearly continuous region of n=500 contrasts with the obvious rectangular region of n=6.
Formal limit notation does not appear in the clip. This refers only to the current analysis segment. Later source content finishes the sum and integral-limit notation, while still not proving general integrability.
The video generalizes the approximation idea of finite-term rectangular sums to the limit case of n\to\infty, thereby obtaining the conclusion that the area is "completely equal."
The same line transitions from the expanded form to (1/n)Σ_{k=1}^n f(k/n).
The summation notation and the term-by-term expansion represent the same rectangular area sum.
The bottom continues from S≈(1/n)Σ... to write lim_{n→∞}[...] = ∫_0^1 f(x)dx.
Applying the limit operation n→∞ to the Riemann sum yields the definite integral representation.
Narration paraphrase: The definite integral, as the result of the limit of rectangular sums, specifically manifests as the geometric meaning of the area under the curve in this example.
The entire derivation is built on the image of rectangles approximating the area under the curve.
The definite integral, as the result of the limit of rectangular sums, specifically manifests as the geometric meaning of the area under the curve in this example.
After writing ∫_0^1, the right side supplements 1≤k≤n and 1/n≤k/n≤1.
Why the integration limits are 0 and 1 depends on the explanation of the range of sample points k/n and their limit.
Narration paraphrase: Which specific area does the video ask to calculate at the beginning?
Narration paraphrase: How to approximate the area of the curvilinear trapezoid using rectangles?
Narration paraphrase: Where does the error in rectangle approximation appear?
Narration paraphrase: Why does increasing the number of divisions make the approximation closer to the true area?
Narration paraphrase: How does this video use geometric figures to explain the meaning of the definite integral?
Narration paraphrase: How does this video use geometric figures to explain the meaning of the definite integral?
This clip only shows geometric intuition and does not write out the formal definition formula of the definite integral. This refers only to the current analysis segment. Later source content finishes the sum and integral-limit notation, while still not proving general integrability.
The blue region is located below the curve f(x), above the x-axis, and between 0 and 1.
Narration paraphrase: What mathematical object does the blue region below the curve f(x) represent in the video?
When n=500, division lines are almost invisible.
Narration paraphrase: Why does the screen look like a single block rather than many rectangles when n=500?
Narration paraphrase: How to translate the animation of rectangles approximating the area under the curve into mathematical expressions?
Subsequently, partition points such as \frac{1}{n}, \frac{2}{n}, \frac{k}{n} are marked on the x-axis.
Narration paraphrase: Why is the width of each small rectangle \frac{1}{n}?
The multiplier \frac{1}{n} appears repeatedly in the handwritten terms.
The screen writes \frac{1}{n} f(\frac{1}{n}).
Narration paraphrase: Why is the area of the first rectangle written as \frac{1}{n} f(\frac{1}{n})?
Narration paraphrase: What process does the video refer to by "using the finite to approximate and simulate the infinite"?
Narration paraphrase: Why is the area S first written as approximately equal to the rectangular sum here, rather than directly equal?
The formula uses ≈.
Covered · Title page, pointing out the theme as the geometric meaning of the definite integral.
Covered · Establishes coordinate system, curve , interval , and the curvilinear trapezoid area problem.
Covered · Uses as an example to explain the rectangle approximation method and source of error.
Covered · Through animation of increasing from 6 to 500, demonstrates the limit idea of decreasing error and approximation approaching true area.
Covered · Visual effect of continuity with n=500 and conceptual distinction between "close/equal."
Covered · Switching back to n=6, and proposing how to write the animation in mathematical language.
Covered · Marking \frac{1}{n}, \frac{2}{n}, \frac{k}{n}, \frac{n-1}{n}, \frac{n}{n}=1 on the x-axis.
Covered · Writing the first two rectangular area terms and explaining adding them up; the complete summation expression is not finished within the clip.
Covered · Establishes the right-endpoint rectangular sum using the example diagram and bottom formula, and rewrites it in summation notation.
Covered · Emphasizes that the finite sum is only an approximation, then takes the limit n→∞ to obtain the definite integral.
Covered · Explains why the integration interval is [0,1] and describes the notation correspondence 1/n→dx, k/n→x.
Covered · The end card is a course catalog and account promotion, with no new mathematical content.
For a Riemann-integrable function on the unit interval, the limit of these right-endpoint sums equals the integral. This video gives intuition rather than a general proof; continuity is a sufficient editorial condition.