Fixed point
A fixed point of a function is a point left unchanged by one application of that function. The video introduces the idea informally as something that “stays the same after a process is applied,” then formalizes it on the board.
CHALK · YouTube · 2:54
This 120-second introductory lecture defines fixed points and periodic points for a function , first giving for a fixed point and then for a point of period . The speaker motivates fixed-point theory by naming topology, chaotic dynamics, and differential equations, then carefully distinguishes iterative period from the periodicity of and . He rephrases period as being fixed by the iterate , and finishes by refining the notion to least or prime period, where no smaller positive iterate returns the point to itself. This 54-second clip opens on a chalkboard that defines a fixed point by , a periodic point of period by , and prime (or least) period by requiring for all while . Side notes place the topic near topology, chaotic dynamics, and differential equations, and a red warning says one does not want to keep including "trivially periodic points." The video then cuts to the presenter, who says that because fixed points and periodic points are related, an accessible theorem proved using fixed point theory is a theorem about periodic points: specifically, Sharkovskii's theorem in the case , described as giving information about the existence of periodic points for a given function. The remainder is navigational commentary pointing to other videos, followed by a fade to black.
Use the learning inspector for key ideas and moments, or open the reading tabs for the complete notes.
Generated from the video's visuals and explanation; not verbatim speech.
The clip opens with an intuitive description: a fixed point is something that stays the same after a process acts on it. This prepares the shift from everyday language to the formal map-based definition.
The lecturer then states the precise rule on the board: if is a fixed point of a function , then . The key idea is that one application of leaves the point unchanged.
Next, the talk motivates the subject by saying fixed-point theorems may initially seem abstract, but they matter in topology, chaotic dynamics, and differential equations. The board lists these fields to connect the definition to broader applications.
The speaker adds that fixed-point theorems are often very general, so applying them in simple settings can produce results that feel surprisingly strong. This commentary bridges motivation to the upcoming extension from fixed points to periodic behavior.
The lecture then defines a periodic point of period : a point satisfies . Here means applying repeatedly times, so the point returns to itself after steps.
To prevent confusion, the speaker contrasts this with the period of functions like and . In trigonometry, periodicity describes repetition in the function’s graph; in this setting, it describes recurrence of a point under iteration.
The same idea is restated in a useful form: saying has period is the same as saying is fixed by the iterate . This links the new definition back to the original fixed-point equation by replacing with .
The lecturer then explains why one should not stop at “some period.” To avoid trivial cases, the focus shifts to the first positive return time, preparing the definition of least or prime period.
Finally, the board gives the formal condition: has least (prime) period if and for every integer with , one has . In words, is the smallest positive number of iterations needed for the point to come back to itself.
The segment ends with the speaker laughing and remarking that the previous sentence was a mouthful, signaling that the dense formal definition has just been completed.
The opening shot is a chalkboard summary rather than a worked derivation. At the top left, the board states the definition of a fixed point of a function as a point satisfying . In the middle right, it defines a periodic point of period by the iterate condition . Along the bottom, it sharpens this to prime or least period by adding the universal requirement that for every integer with , one has , while still . The surrounding annotations place the topic in "TOPOLOGY," "CHAOTIC DYNAMICS," and "DIFFERENTIAL EQUATIONS," label the area "FIXED POINT THEORY," and warn in a red oval that "WE DON'T WANT TO ALWAYS BE INCLUDING TRIVIALLY PERIODIC POINTS." Orange sketches marked "NOT LIKE" beside and signal that the lesson is not simply about ordinary periodic functions in the elementary graphing sense.
The scene changes to the presenter speaking directly to camera. He says that, in light of the relationship between fixed points and periodic points, one accessible theorem whose proof uses fixed point theory is actually a theorem about periodic points. This spoken bridge explains why the board began with the fixed-point definition before moving to iterates: the later result will use fixed-point ideas as a tool for proving existence statements about periodic behavior.
He then names the result: it is a case of Sharkovskii's theorem, more specifically the case . A brief on-screen caption reads "SHARKOVSKII'S." The clip does not state the full theorem, only that this case concerns the existence of periodic points for a given function. Because the preceding board definitions distinguished ordinary periodic points from prime period, the natural reading is that the theorem belongs to the study of when iterates force the appearance of periodic orbits of specified periods.
The rest of the segment is outro guidance rather than new mathematics. The speaker says that viewers interested in developing the ideas behind Sharkovskii's theorem for can click one suggested video, while viewers interested in examples of "fixed point magic" from applications of fixed point theory can choose another. No further definitions, hypotheses, or proof steps are introduced before the image fades to black.
A fixed point of a function is a point left unchanged by one application of that function. The video introduces the idea informally as something that “stays the same after a process is applied,” then formalizes it on the board.
Although the definition alone may seem dry, the lecturer says fixed-point theorems are important in topology, chaotic dynamics, and differential equations. The board lists these fields as motivation for studying fixed points.
A periodic point returns to itself after repeated application of a function. If has period for , then applying exactly times brings back to .
The lecturer explicitly warns that “period” here does not mean the same thing as the period of or . Trigonometric periodicity concerns repetition within the function’s graph, while this lecture concerns recurrence of a point under iteration.
The definition can be rephrased: a point of period for is a fixed point of the iterate . This connects periodic points back to the original fixed-point pattern by treating as the relevant function.
To avoid trivial cases, the lecture refines the notion of period by requiring that be the first positive return time. Thus no smaller positive iterate sends back to itself.
A fixed point of a function is a point that is unchanged by applying . The board presents this as the entry point to fixed point theory and contrasts it with the later iterate-based notions of periodicity.
A point is periodic of period for if the -fold iterate of sends back to itself. This generalizes the fixed-point condition from one application of to applications.
Prime or least period means that returns under but under no smaller positive iterate. This excludes points that would otherwise be counted as having period merely because a multiple of their true period also returns them.
The red board note says one does not want to keep including "trivi ally periodic points." In dynamical systems, distinguishing least period from any larger return time is essential for classifying orbits correctly.
The presenter identifies the upcoming application as Sharkovskii's theorem in the case , describing it as a theorem about the existence of periodic points for a given function. The clip names the result but does not give its full statement or proof.
The spoken introduction emphasizes that a theorem about periodic points can be proved using fixed point theory. This links the simple equation to deeper existence results for iterated dynamics.
Explore conditions, steps and evidence. Supplementary explanations are labeled separately from content shown in the video.
The speaker says “a function f” while introducing fixed points and periodic points.
Chalkboard text uses in , , and the least-period condition.
f
A function whose iterates are being considered.
The video does not state a specific domain or codomain for .
The speaker says “a fixed point x of a function f satisfies the property that f of x is equal to x.”
Chalkboard writes “A FIXED POINT x OF A FUNCTION f SATISFIES THE PROPERTY” and below it .
x
A point that is unchanged by one application of .
The video does not specify the ambient set containing .
The speaker says “a periodic point p of period m of a function f has the property that f to the m of p is equal to p.”
Chalkboard writes “A PERIODIC POINT p OF PERIOD m OF A FUNCTION f SATISFIES THE PROPERTY” and below it ; later the least-period definition also uses .
p
A point that returns to itself after iterating some number of times.
The video does not specify the ambient set containing .
The speaker says “period m” and later “the first k greater than or equal to 1 for which f to the k of p is p is m.”
Chalkboard uses in and in the least-period statement .
m
A positive integer period attached to a periodic point.
The video treats as a period index; it does not explicitly write , though the spoken definition implies a counting number.
The speaker says “the first k greater than or equal to 1 for which f to the k of p is p is m.”
Chalkboard writes in the least-period definition.
k
An iterate count used to test whether a smaller positive return time exists.
In the displayed condition, ranges over integers with .
The speaker says “f to the m of p” and explains this as “f applied m times.”
Chalkboard writes and later and .
The -fold composition (iterate) of with itself.
Defined implicitly for positive integers by repeated application of .
The speaker says “f to the k of p is p” while defining least period.
Chalkboard writes in the universal condition for .
The -fold iterate of .
Used here for integers with .
Board text: "Def^n: A FIXED POINT x OF A FUNCTION f SATISFIES THE PROPERTY" followed by the displayed equation .
Defining property of a fixed point: applying the function to the point returns itself.
is a point in the domain of ; is a function.
Board text: "Def^m: A PERIODIC POINT p OF PERIOD m OF A FUNCTION f SATISFIES THE PROPERTY" followed by the displayed equation .
Defining property of a periodic point of period : the -fold iterate of at equals .
is a point in the domain of ; is a positive integer period.
Board text: "Def^k: A POINT p IS OF PRIME (OR LEAST) PERIOD m IF" followed by and the condition but . The quantifier line is visible as .
,
Universal quantification over integers strictly between and , used to require that no earlier iterate returns to .
ranges over integers with .
Speaker says this is "Sharkovskii's theorem when n is equal to three."
The specific case of Sharkovskii's theorem being referenced in the spoken introduction.
Integer parameter naming the theorem case.
The speaker gives the formal definition of a fixed point.
Chalkboard writes “A FIXED POINT x OF A FUNCTION f SATISFIES THE PROPERTY” and .
A fixed point of a function is a point that remains unchanged after applying the function once. In the video’s notation, if is a fixed point of , then applying to returns itself.
is a function under consideration.
is a point in the domain where is defined.
The speaker defines a periodic point of period by saying applied times sends back to .
Chalkboard writes “A PERIODIC POINT p OF PERIOD m OF A FUNCTION f SATISFIES THE PROPERTY” and .
A periodic point of period is a point that returns to itself after iterations of the function. The video emphasizes that this is recurrence under repeated application of , not the same notion of period used for trigonometric functions.
is a function under consideration.
is a positive integer counting the number of iterations.
is a point for which the iterates are defined.
The speaker says they will focus on points of least or prime period , defined so that the first with is .
Chalkboard writes “A POINT p IS OF PRIME (OR LEAST) PERIOD m IF” followed by , BUT .
A point has least or prime period if it returns to itself after iterations and does not return earlier at any smaller positive iterate. This excludes trivial cases where a point already repeats with a divisor-like smaller period.
is a positive integer.
ranges over integers with .
is a periodic point of .
Top-left board definition reads "Def^n: A FIXED POINT x OF A FUNCTION f SATISFIES THE PROPERTY" with .
Nearby label "FIXED POINT THEORY" and small stick-figure doodles accompany the definition.
The board defines a fixed point of a function as a point satisfying . This is presented as the basic object of "FIXED POINT THEORY".
is a function.
is a point in the domain of .
Middle-right board definition reads "Def^m: A PERIODIC POINT p OF PERIOD m OF A FUNCTION f SATISFIES THE PROPERTY" with .
A red oval nearby states "WE DON'T WANT TO ALWAYS BE INCLUDING TRIVIALLY PERIODIC POINTS," motivating the next definition.
The board defines a periodic point of period for a function by the iterate equation . The surrounding note indicates that one often wants to exclude points that are only trivially periodic, leading to the notion of prime or least period.
is a function.
is a point in the domain of .
is a positive integer.
Bottom board definition reads "Def^k: A POINT p IS OF PRIME (OR LEAST) PERIOD m IF" followed by and but .
The board defines prime or least period by requiring both that the -th iterate returns to and that no smaller positive iterate below does so. This sharpens the previous periodic-point definition by excluding earlier repetitions.
is the candidate period.
For every integer with , the iterate is not equal to .
The iterate equals .
Speaker says: "It is a case of Sharkovskii's theorem, or more specifically, Sharkovskii's theorem when n is equal to three."
On-screen caption appears as "SHARKOVSKII'S" around 18.5 seconds.
The clip names the theorem case but does not state the full formal hypothesis or conclusion of Sharkovskii's theorem.
In the spoken portion, the presenter identifies the relevant application of fixed point theory as a case of Sharkovskii's theorem, specifically the case , and says it concerns the existence of periodic points for a given function.
The theorem is invoked as an existence result about periodic points.
Only the case name is stated in this clip.
Speaker says: "In light of the relationship between fixed points and periodic points, one of the more accessible theorems that uses fixed point theory in its proof is a proof about periodic points."
The exact mathematical statement of the relationship is not spelled out verbally in this clip; it is supported visually by the board definitions.
Because fixed points and periodic points are related, an accessible theorem proved using fixed point theory can be a theorem about periodic points.
The board definitions of fixed points, periodic points, and prime period are available as context.
No explicit quantifiers are spoken in this claim.
Speaker says this is "Sharkovskii's theorem when n is equal to three, which tells us about the existence of periodic points for a given function."
Caption "SHARKOVSKII'S" appears on screen.
The precise hypotheses on the function and the exact implication among periods in Sharkovskii's theorem are not stated in this clip.
The case of Sharkovskii's theorem with gives information about the existence of periodic points for a given function.
A function under consideration is assumed, though the clip does not specify its domain, regularity, or other conditions.
Existential statement about periodic points is asserted informally; full quantifier structure is not given in the clip.
The speaker contrasts the present notion of period with the period of sine and cosine, saying the trigonometric case references recurrence within the function, whereas here recurrence means after applying a function many times.
Chalkboard shows “NOT LIKE” with sketches labeled and beside small coordinate axes and waveforms.
Start from the definition just written on the board: means the point returns after applications of .
This is the periodic-point definition stated immediately before the contrast.
Then the speaker compares this with familiar periodic functions such as and , whose graphs repeat along the input axis.
Supported by the spoken explanation and the chalkboard sketches labeled and .
The conclusion drawn is that the word “period” is being used differently: here it refers to recurrence of a point under iteration, not repetition of a function’s graph.
Explicitly stated in the audio: “this is a different notion of period than is used in the context of trigonometric functions.”
In this lecture, “period ” means that a point returns after iterations of a function, which is conceptually distinct from the usual periodicity of trigonometric functions.
The speaker says that when a point has period , what is really being said is that is fixed by , i.e. applied times.
The board already contains for fixed points and for periodic points.
Take the definition of a periodic point of period .
Written on the chalkboard and spoken aloud.
Regard the -fold iterate itself as a new function .
This is a standard reinterpretation of the displayed equation; the video explicitly says the point is fixed by .
Then the equation becomes , which matches the fixed-point form.
Direct substitution into the fixed-point pattern .
A point of period for can be viewed as a fixed point of the iterate ; in particular, an ordinary fixed point corresponds to the case . This final specialization to is an editorial clarification rather than a separately spoken sentence.
A hand writes the fixed-point definition across the top of a dark chalkboard in white chalk.
The visible text reads “A FIXED POINT x OF A FUNCTION f SATISFIES THE PROPERTY” with underneath.
dark chalkboard
hand writing in white chalk
text line defining fixed point
formula
The board goes from blank to showing the full fixed-point definition.
The formula appears beneath the sentence.
The setting remains a single chalkboard view.
The notation uses for the point and for the function.
The visual establishes the basic object of the lecture: a point unchanged by one application of a function.
Below the fixed-point definition, the presenter draws two stick figures with a heart and writes a list of fields.
Visible words include “TOPOLOGY”, “CHAOTIC DYNAMICS”, “DIFFERENTIAL EQUATIONS”, and “FIXED POINT THEORY”.
stick-figure drawing
heart symbol
list of application areas
label “FIXED POINT THEORY”
New colored annotations appear beneath the fixed-point definition.
The list of fields is added and linked to the phrase “FIXED POINT THEORY”.
The original fixed-point definition remains visible above.
The board visually motivates the topic by connecting fixed-point ideas to topology, chaotic dynamics, and differential equations.
A second definition is written lower on the board.
The visible text reads “A PERIODIC POINT p OF PERIOD m OF A FUNCTION f SATISFIES THE PROPERTY” with underneath.
chalkboard text for periodic point
formula
A new definition line is added beneath the earlier material.
The notation shifts from one application to an iterate .
The same function symbol is reused.
The board still concerns recurrence properties of points under maps.
This extends the fixed-point idea from one step to multiple iterations.
To the right of the periodic-point definition, the presenter writes “NOT LIKE” and sketches small coordinate systems with waveforms labeled and .
The exact shape of each waveform is schematic rather than a precise graph.
text “NOT LIKE”
small axes
waveform sketches
labels and
A comparison region is added to the right side of the board.
The lecture visually separates point recurrence from graph repetition.
The periodic-point formula remains the main reference point.
The sketch signals that “period” here is not the same as the ordinary periodicity of trigonometric functions.
A red note appears near the periodic-point section reading “WE DON'T WANT TO ALWAYS BE ANALYZING TRIVIALLY PERIODIC POINTS”, circled in red.
red handwritten note
circle around the note
arrow toward the next definition
A warning-style annotation is added to the board.
An arrow directs attention downward to the forthcoming least-period definition.
The existing periodic-point definition stays in place.
The visual prepares the refinement from any period to the first, nontrivial return time.
A green definition is written at the bottom of the board.
The visible text reads “A POINT p IS OF PRIME (OR LEAST) PERIOD m IF” followed by , BUT .
green chalk text
universal quantifier over
inequality
conditions and
A more restrictive definition replaces the informal idea of merely having some period.
The board now distinguishes earlier returns from the first return.
The symbols , , and continue the same roles as before.
This formalizes the notion of the minimal positive return time of a periodic point.
A chalkboard fills the frame with three definitions in white, a purple list "TOPOLOGY / CHAOTIC DYNAMICS / DIFFERENTIAL EQUATIONS," a pink note "FIXED POINT THEORY," a red oval saying "WE DON'T WANT TO ALWAYS BE INCLUDING TRIVIALLY PERIODIC POINTS," and orange sketches labeled "NOT LIKE" with and .
Speaker comments: "I think the math I've written on the board is a bit more straightforward than the English it corresponds to."
Three handwritten definitions.
Purple subject list.
Pink "FIXED POINT THEORY" label.
Red oval cautionary note.
Orange sine/cosine sketches labeled "NOT LIKE".
The shot remains static while the speaker talks over the board.
The definitions and annotations stay visible throughout the opening shot.
The visual layout organizes the lesson from fixed points to periodic points to prime period, while the side notes place the topic within topology, chaotic dynamics, and differential equations and warn against counting trivial periodic behavior.
Lower-left caption reads "SHARKOVSKII'S" while the speaker names the theorem.
Speaker says "Sharkovskii's theorem" during the same interval.
Presenter speaking to camera.
Lower-left text caption.
Caption appears briefly and then disappears.
The spoken reference and caption align on the theorem name.
The caption reinforces the proper name of the theorem being introduced verbally.
The speaker explicitly warns that this is a different notion of period than is used for trigonometric functions like sine and cosine.
The board writes “NOT LIKE” beside sketches of and .
One may think that saying a point has period means the same thing as a function such as repeating its graph every .
Here, period means that after applying the function times, the point comes back to itself: . It is recurrence of a point under iteration, not repetition of a function’s output pattern over its input variable.
The speaker says they want to focus on nontrivial cases and introduces points of least or prime period.
The board adds the condition together with .
If , one might call the period without checking whether the point already returned earlier.
The lecture refines this by defining least (prime) period: is the first positive iterate for which , and no smaller with satisfies .
Red oval on the board states: "WE DON'T WANT TO ALWAYS BE INCLUDING TRIVIALLY PERIODIC POINTS."
This note sits between the definition of a periodic point and the definition of prime (or least) period.
One might stop at the condition and count points whose return happens earlier as if they had period .
The board explicitly introduces prime (or least) period to exclude such trivial cases by requiring for every .
Orange annotation "NOT LIKE" points toward sketches labeled and .
No accompanying verbal explanation is heard in this clip.
The exact intended contrast is not explained in the clip; it may refer to ordinary periodic functions versus discrete dynamical notions of periodic points, but that interpretation is not directly stated.
The presence of and could suggest the lesson is about classical periodic functions in the usual analytic sense.
The board marks these sketches as "NOT LIKE," indicating they are contrastive examples rather than the main objects; the actual definitions concern iterates of a function returning a point to itself.
After defining fixed points, the speaker says fixed points are closely related to periodic points and then defines period via .
The board juxtaposes with .
The periodic-point definition extends the fixed-point idea from one application of to applications of .
The speaker introduces least or prime period to avoid trivial cases.
The board adds the extra universal condition excluding earlier returns.
Least period is a special, nontrivial version of periodicity: it requires and rules out any smaller positive return time.
The speaker says a point of period is fixed by .
Both and are visible on the board.
Saying has period for is equivalent to saying is a fixed point of the iterate ; this equivalence is made explicit in the spoken reinterpretation.
The board presents first and then second.
Speaker later refers to "the relationship between fixed points and periodic points."
A fixed point is the one-step case of the iterate-return idea, while a periodic point generalizes this to an -step return under .
The definition of periodic point is followed by the stricter definition of prime (or least) period with the extra condition on all smaller .
The red oval about avoiding "TRIVIALLY PERIODIC POINTS" links the two definitions.
Prime period refines the notion of periodic point by adding a minimality requirement, so it distinguishes genuine least period from any larger iterate that also returns to the point.
After defining periodic and prime period on the board, the speaker introduces Sharkovskii's theorem as a result about the existence of periodic points.
The clip does not spell out whether Sharkovskii's theorem is stated in terms of prime period explicitly, though the preceding board setup strongly suggests periodic-point existence is the target concept.
The theorem named in the introduction applies the periodic-point framework developed on the board to an existence question for a given function.
Speaker says one accessible theorem "uses fixed point theory in its proof" and is "a proof about periodic points."
The actual proof is not shown in this clip.
The introduction states that the proof of the periodic-point theorem uses fixed point theory, linking the fixed-point definition to the method behind Sharkovskii's theorem case .
Formal spoken definition of fixed point.
Board writes .
The speaker says fixed-point theorems are important to topology, chaotic dynamics, and differential equations.
Those field names are written on the board.
Spoken definition of periodic point of period .
Board writes .
The speaker contrasts this use of period with sine and cosine.
Board writes “NOT LIKE” with and sketches.
The speaker says a point of period is fixed by , meaning applied times.
Spoken definition of least or prime period.
Board writes the universal condition over with .
The speaker says they focus on nontrivial cases as often as possible.
Red note says they do not want to always analyze trivially periodic points.
Board definition is visible.
Board definition is visible.
Red oval warns against including "TRIVIALLY PERIODIC POINTS."
Prime-period definition adds , .
Speaker names "Sharkovskii's theorem when n is equal to three" and says it concerns existence of periodic points.
Speaker says the theorem "uses fixed point theory in its proof."
Covered · Informal introduction explaining that a fixed point stays the same after a process is applied; this motivates the formal definition that follows.
Covered · Formal definition of a fixed point is spoken and written as .
Covered · Motivational discussion of why fixed-point theorems matter, with applications listed on the board.
Covered · General commentary on the power and generality of fixed-point theorems, leading into the relation between fixed points and periodic points.
Covered · Formal definition of a periodic point of period is spoken and written as .
Covered · Contrast with trigonometric periodicity and reinterpretation of period as being fixed by .
Covered · Transition explaining the desire to avoid trivial periodic points and setting up the refined definition.
Covered · Formal definition of least or prime period is spoken and written with the condition on all smaller .
Covered · The speaker laughs and remarks that the previous sentence was a mouthful; no new mathematical content is introduced.
Covered · Static chalkboard shot showing the three definitions, subject list, fixed-point-theory label, warning about trivial periodic points, and sine/cosine contrast sketches while the speaker comments on the board writing.
Covered · Talking-head shot in which the speaker explains that an accessible theorem proved with fixed point theory concerns periodic points.
Covered · Speaker identifies the theorem as Sharkovskii's theorem in the case ; the caption "SHARKOVSKII'S" appears on screen.
Covered · Speaker continues by saying the theorem tells us about existence of periodic points for a given function and then directs viewers to other videos; no additional mathematical definitions, formulas, or proofs are introduced before the fade to black.
Reviewed explanation connection to Fixed and periodic points.