Glanz: aiMOOC über GPT aiMOOC Action erstellt

2026-09-01T05:10:33Z

aiMOOC über GPT aiMOOC Action erstellt

Neue Seite

{{T}}
[[Category:English]]
[[Category:Real Analysis]]

{{BR}}
= Introduction =

'''Real analysis''' is the rigorous study of the real numbers, limits, continuity, differentiation, integration, sequences, series, and the structural ideas that make calculus work. In this university-level aiMOOC, you move from computational familiarity with calculus to proof-based reasoning. You will learn not only how to calculate a limit or derivative, but also how to prove that a limit exists, explain why continuity matters, identify the role of completeness, and recognize where familiar calculus statements can fail.

The central theme is '''control of approximation'''. Real analysis turns intuitive phrases such as “arbitrarily close,” “eventually,” and “without gaps” into precise definitions. These definitions let you prove theorems that support calculus and prepare you for [[English:Measure theory|Measure theory]], [[English:Functional analysis|Functional analysis]], [[English:Probability theory|Probability theory]], [[English:Differential equations|Differential equations]], [[English:Topology|Topology]], and advanced numerical mathematics.

{{#ev:youtube|https://www.youtube.com/watch?v=BWvjy0a1Ffg|500|center}}

The video above is an MIT OpenCourseWare introduction to real numbers and proof-based real analysis. As you watch, notice how definitions and proofs replace reliance on graphs or numerical evidence alone.

{{BR}}
== Prerequisites and Learning Goals ==

You should be comfortable with single-variable [[English:Calculus|Calculus]], elementary algebra, functions, inequalities, and basic set notation. Prior proof experience is helpful but not required.

By the end of this aiMOOC, you should be able to:
# [[English:Mathematical proof|Write rigorous proofs]] using definitions, quantifiers, contradiction, contrapositive arguments, induction, and counterexamples.
# [[English:Real number|Use the order and completeness properties of the real numbers]] to prove existence statements.
# [[English:Sequence|Analyze sequences and series]] using precise convergence criteria.
# [[English:Limit of a function|Prove limits]] with epsilon-delta and sequential arguments.
# [[English:Continuous function|Distinguish continuity and uniform continuity]] and apply compactness-based theorems.
# [[English:Compact space|Use compactness and connectedness]] to understand global properties of continuous functions.
# [[English:Derivative|Justify differentiation theorems]] such as Rolle's theorem and the Mean Value Theorem.
# [[English:Riemann integral|Define and analyze Riemann integration]] and explain the Fundamental Theorem of Calculus.

{{BR}}
= The Real Numbers and Completeness =

The real numbers form an ordered field, but the property that makes them especially powerful for analysis is '''completeness'''. One common form is the '''least-upper-bound property''': every nonempty set of real numbers that is bounded above has a least upper bound, also called its [[English:Supremum|supremum]].

If a set <math>A\subseteq\mathbb{R}</math> is bounded above, a number <math>M</math> is an upper bound when <math>a\le M</math> for every <math>a\in A</math>. The supremum <math>s=\sup A</math> is an upper bound that is no larger than any other upper bound. The definition has two parts: every element of <math>A</math> is at most <math>s</math>, and for every <math>\varepsilon>0</math> there is some <math>a\in A</math> with <math>s-\varepsilon<a</math>. The second part expresses that no smaller number can still be an upper bound.

The rational numbers do not have this completeness property. For example, the rational numbers whose squares are less than 2 are bounded above in <math>\mathbb{Q}</math>, but they have no rational least upper bound. In <math>\mathbb{R}</math>, the missing boundary point is <math>\sqrt{2}</math>.

[[File:Dedekind cut at square root of two.svg|500px|frameless|center]]

The image shows a [[English:Dedekind cut|Dedekind cut]] associated with <math>\sqrt{2}</math>. It illustrates one way to construct the real numbers by filling gaps in the rationals.

Completeness appears in several equivalent or closely related forms in elementary real analysis. Important consequences include the monotone convergence theorem for sequences, the nested interval property, the Bolzano-Weierstrass theorem, and the fact that every Cauchy sequence of real numbers converges to a real number.

{{#ev:youtube|https://www.youtube.com/watch?v=mlPLLXHZ8_U|500|center}}

This MIT OpenCourseWare lecture develops the ordered-field structure and characterization of the real numbers.

{{BR}}
== A Proof Pattern with Suprema ==

Suppose <math>(a_n)</math> is increasing and bounded above. Let <math>L=\sup\{a_n:n\in\mathbb{N}\}</math>. To prove <math>a_n\to L</math>, start with an arbitrary <math>\varepsilon>0</math>. Because <math>L-\varepsilon</math> cannot be an upper bound, some term <math>a_N</math> satisfies <math>L-\varepsilon<a_N\le L</math>. Since the sequence is increasing, every <math>n\ge N</math> satisfies <math>L-\varepsilon<a_N\le a_n\le L</math>. Hence <math>|a_n-L|<\varepsilon</math> for all sufficiently large <math>n</math>.

This proof is a model for real analysis: an abstract existence principle is converted into an explicit epsilon estimate.

{{BR}}
= Sequences, Cauchy Sequences, and Series =

A sequence <math>(a_n)</math> converges to <math>L</math> if for every <math>\varepsilon>0</math> there exists <math>N\in\mathbb{N}</math> such that <math>n\ge N</math> implies <math>|a_n-L|<\varepsilon</math>. The index <math>N</math> may depend on <math>\varepsilon</math>, but it must work for all later terms.

[[File:Converging Sequence example.svg|500px|frameless|center]]

The picture visualizes a convergent sequence whose terms approach zero. A graph can suggest convergence, but a proof must control all sufficiently large indices.

A sequence is a '''Cauchy sequence''' if its terms eventually become arbitrarily close to one another: for every <math>\varepsilon>0</math> there is an <math>N</math> such that <math>m,n\ge N</math> implies <math>|a_m-a_n|<\varepsilon</math>. Every convergent sequence is Cauchy. The completeness of <math>\mathbb{R}</math> gives the converse: every Cauchy sequence of real numbers converges.

{{#ev:youtube|https://www.youtube.com/watch?v=0_w-R_g5lRA|500|center}}

This lecture introduces Cauchy sequences, completeness, and the transition from sequences to infinite series.

{{BR}}
== Subsequences and Bolzano-Weierstrass ==

A [[English:Subsequence|subsequence]] keeps infinitely many terms of a sequence in their original order. Subsequence arguments are fundamental because they isolate convergent behavior that may be hidden inside a nonconvergent sequence.

The '''Bolzano-Weierstrass theorem''' states that every bounded sequence of real numbers has a convergent subsequence. A common proof repeatedly bisects a bounded interval and chooses a half containing infinitely many sequence terms. The nested intervals shrink to a point, and a carefully selected subsequence converges to that point.

[[File:Bolzano–Weierstrass theorem - step 3.svg|500px|frameless|center]]

This interval-halving idea later reappears in compactness arguments, root-finding methods, and multivariable analysis.

{{BR}}
== Infinite Series ==

An infinite series <math>\sum_{n=1}^{\infty}a_n</math> converges when its sequence of partial sums <math>s_N=\sum_{n=1}^{N}a_n</math> converges. Therefore, every series question is ultimately a sequence question.

Useful convergence tools include the comparison test, limit comparison test, ratio test, root test, alternating-series test, and Cauchy criterion. Remember that <math>a_n\to0</math> is necessary for convergence of <math>\sum a_n</math>, but it is not sufficient. The harmonic series is the standard counterexample.

Absolute convergence, conditional convergence, and rearrangement show that infinite addition behaves differently from finite addition. These distinctions become even more important when you study power series, Fourier series, and function spaces.

{{BR}}
= Limits and Continuity =

For a function <math>f</math>, the statement <math>\lim_{x\to a}f(x)=L</math> means:

<math>\forall\varepsilon>0\ \exists\delta>0\ \forall x,\quad 0<|x-a|<\delta\Rightarrow |f(x)-L|<\varepsilon.</math>

The order of the quantifiers matters. You must choose <math>\delta</math> after seeing <math>\varepsilon</math>, and that one choice of <math>\delta</math> must work for every allowed <math>x</math> near <math>a</math>.

[[File:Epsilon-delta limit.svg|500px|frameless|center]]

An epsilon-delta proof typically has two phases. In the '''discovery phase''', you work backward from <math>|f(x)-L|<\varepsilon</math> to guess a useful restriction on <math>|x-a|</math>. In the '''formal phase''', you present a forward proof: given <math>\varepsilon>0</math>, choose a specific <math>\delta>0</math>, assume <math>0<|x-a|<\delta</math>, and derive the desired epsilon inequality.

{{BR}}
== Sequential Criterion for Limits ==

A powerful equivalent formulation says that <math>\lim_{x\to a}f(x)=L</math> if and only if for every sequence <math>(x_n)</math> with <math>x_n\ne a</math> and <math>x_n\to a</math>, the sequence <math>f(x_n)</math> converges to <math>L</math>. This criterion is especially useful for disproving a proposed limit: find two sequences approaching the same point whose function values have different limiting behavior.

{{#ev:youtube|https://www.youtube.com/watch?v=bBESL68iX6s|500|center}}

This MIT OpenCourseWare lecture connects limits of functions, limits of sequences, and continuity.

{{BR}}
== Continuity and Uniform Continuity ==

A function is continuous at <math>a</math> when <math>\lim_{x\to a}f(x)=f(a)</math>. Equivalently, for every <math>\varepsilon>0</math> there is a <math>\delta>0</math> such that <math>|x-a|<\delta</math> implies <math>|f(x)-f(a)|<\varepsilon</math>.

For ordinary continuity, the allowable <math>\delta</math> may depend on both <math>\varepsilon</math> and the point <math>a</math>. For '''uniform continuity''' on a set <math>E</math>, one <math>\delta</math> must work everywhere in the domain for a given <math>\varepsilon</math>:

<math>\forall\varepsilon>0\ \exists\delta>0\ \forall x,y\in E,\quad |x-y|<\delta\Rightarrow |f(x)-f(y)|<\varepsilon.</math>

[[File:Definition of Uniform continuity.gif|500px|frameless|center]]

The '''Heine-Cantor theorem''' says that every continuous real-valued function on a compact set is uniformly continuous. On a closed bounded interval, this gives a strong global form of continuity.

{{#ev:youtube|https://www.youtube.com/watch?v=f_sNWn7zujU|500|center}}

This lecture develops uniform continuity and connects it with differentiation.

{{BR}}
= Compactness, Connectedness, and Global Theorems =

In <math>\mathbb{R}</math>, the '''Heine-Borel theorem''' states that a set is compact if and only if it is closed and bounded. Compactness has several equivalent formulations in this setting. Every open cover has a finite subcover, and every sequence in a compact set has a convergent subsequence whose limit remains in the set.

Compactness turns local information into global conclusions. If <math>f:[a,b]\to\mathbb{R}</math> is continuous, then:
# the [[English:Extreme value theorem|Extreme value theorem]] guarantees that <math>f</math> attains both a maximum and a minimum;
# the [[English:Heine–Cantor theorem|Heine–Cantor theorem]] guarantees that <math>f</math> is uniformly continuous;
# compactness supplies convergent subsequences in many existence proofs.

A set in <math>\mathbb{R}</math> is connected precisely when it is an interval. The continuous image of a connected set is connected. This structural fact leads to the '''Intermediate Value Theorem''': if <math>f</math> is continuous on <math>[a,b]</math> and a number <math>y</math> lies between <math>f(a)</math> and <math>f(b)</math>, then some <math>c\in[a,b]</math> satisfies <math>f(c)=y</math>.

[[File:Illustration for the intermediate value theorem.svg|500px|frameless|center]]

The theorem proves existence without necessarily producing a closed-form solution. It justifies methods such as bisection for finding roots.

{{BR}}
== The Cantor Set as a Stress Test ==

The [[English:Cantor set|Cantor set]] is constructed from <math>[0,1]</math> by repeatedly removing the open middle third from every remaining interval.

[[File:Cantor set in seven iterations.svg|500px|frameless|center]]

The Cantor set is closed, bounded, compact, perfect, nowhere dense, uncountable, and has length zero in the sense of Lebesgue measure. It is a valuable example because it challenges geometric intuition: a set can contain uncountably many points while containing no interval. Studying the Cantor set prepares you for [[English:Topology|Topology]], [[English:Measure theory|Measure theory]], fractals, and more advanced real analysis.

{{BR}}
= Differentiation and the Mean Value Theorem =

The derivative of <math>f</math> at <math>a</math> is the limit

<math>f'(a)=\lim_{h\to0}\frac{f(a+h)-f(a)}{h},</math>

provided the limit exists. Differentiability implies continuity, but continuity does not imply differentiability.

The '''Mean Value Theorem''' states that if <math>f</math> is continuous on <math>[a,b]</math> and differentiable on <math>(a,b)</math>, then there is some <math>c\in(a,b)</math> such that

<math>f'(c)=\frac{f(b)-f(a)}{b-a}.</math>

This theorem connects local information about derivatives with global changes in function values. It yields important consequences: a function with zero derivative on an interval is constant; derivative bounds give Lipschitz-type estimates; and monotonicity can be deduced from the sign of the derivative.

Rolle's theorem is the special case in which <math>f(a)=f(b)</math>. It is frequently used as the core lemma in proofs of the Mean Value Theorem and related results.

{{BR}}
= Riemann Integration =

The Riemann integral makes the intuitive idea of area and accumulation rigorous by approximating a function with finite sums over partitions.

For a bounded function <math>f:[a,b]\to\mathbb{R}</math>, choose a partition <math>P</math> of <math>[a,b]</math>. On each subinterval, take the infimum and supremum of <math>f</math>. The resulting lower and upper sums bound any reasonable rectangle-based approximation. A bounded function is Riemann integrable when its upper and lower integrals agree. Equivalently, for every <math>\varepsilon>0</math> there is a partition for which the upper sum minus the lower sum is less than <math>\varepsilon</math>.

[[File:Riemann sum convergence.svg|500px|frameless|center]]

Every continuous function on a closed bounded interval is Riemann integrable. Every monotone function on such an interval is also Riemann integrable. These results depend on the ability to control oscillation on sufficiently small subintervals.

The '''Fundamental Theorem of Calculus''' links differentiation and integration. In one standard form, if <math>f</math> is continuous on <math>[a,b]</math> and <math>F(x)=\int_a^x f(t)\,dt</math>, then <math>F</math> is differentiable on <math>(a,b)</math> and <math>F'(x)=f(x)</math>. Another form evaluates definite integrals using antiderivatives.

{{#ev:youtube|https://www.youtube.com/watch?v=WWZ_CeiRnIo|500|center}}

This MIT OpenCourseWare lecture proves the Fundamental Theorem of Calculus and related properties of the Riemann integral.

{{BR}}
= Proof Strategy in Real Analysis =

A successful proof begins by identifying the exact definition that controls the statement. Before doing algebra, rewrite the goal in quantifier form and decide what must be chosen and what is given.

Common proof patterns include direct proof, proof by contrapositive, contradiction, induction, construction of subsequences, epsilon estimates, and counterexamples. In analysis, counterexamples are not side notes; they tell you why hypotheses are necessary.

For example, if a theorem assumes compactness, test what happens on an open or unbounded set. If a theorem assumes uniform convergence, search for a pointwise-convergent sequence that loses continuity in the limit. If a theorem assumes differentiability, test a function with a corner or cusp.

A useful proof-writing checklist is:
# State the arbitrary objects and hypotheses clearly.
# Name the definition or theorem you are using.
# Make every dependence explicit, especially choices of <math>N</math> or <math>\delta</math>.
# Justify inequalities and limiting steps.
# End by matching your conclusion to the exact statement you intended to prove.

{{BR}}
= Interactive Tasks =

{{BR}}
== Quiz: Test Your Knowledge ==

{{MC}}

'''Which property distinguishes the real numbers from the rational numbers in basic real analysis?'''
(The least upper bound property)
(!Closure under addition)
(!Existence of additive inverses)
(!Order compatibility with multiplication)

{{E}}
<br>

{{MC}}

'''What must be true for a sequence to converge to a real number L?'''
(Eventually every term lies within every positive error tolerance of L)
(!Every term equals L after a finite index)
(!The sequence must be monotone)
(!The sequence must contain only positive terms)

{{E}}
<br>

{{MC}}

'''What does completeness of the real numbers imply about Cauchy sequences?'''
(Every Cauchy sequence converges to a real number)
(!Every bounded sequence is monotone)
(!Every divergent sequence is unbounded)
(!Every series with small terms converges)

{{E}}
<br>

{{MC}}

'''Which statement is the Bolzano-Weierstrass theorem for real sequences?'''
(Every bounded sequence has a convergent subsequence)
(!Every convergent sequence is strictly increasing)
(!Every unbounded sequence has a finite limit)
(!Every subsequence has the same first term)

{{E}}
<br>

{{MC}}

'''In an epsilon-delta proof of a function limit, what may delta depend on?'''
(The chosen positive epsilon)
(!The particular nearby input point)
(!The value of every later sequence term)
(!The final index of a finite list)

{{E}}
<br>

{{MC}}

'''What extra feature distinguishes uniform continuity from ordinary continuity?'''
(One delta works across the whole domain for a fixed epsilon)
(!The function must be differentiable everywhere)
(!The domain must contain only integers)
(!The function must have a constant derivative)

{{E}}
<br>

{{MC}}

'''Which condition characterizes compact subsets of the real line?'''
(Closed and bounded)
(!Open and bounded)
(!Closed and unbounded)
(!Dense and countable)

{{E}}
<br>

{{MC}}

'''What does the Intermediate Value Theorem guarantee for a continuous function on an interval?'''
(Every value between the endpoint values is attained)
(!Every value has exactly one preimage)
(!The derivative exists at every point)
(!The function is necessarily monotone)

{{E}}
<br>

{{MC}}

'''Which statement follows from the Mean Value Theorem?'''
(A function with zero derivative on an interval is constant)
(!Every continuous function is differentiable)
(!Every bounded function has zero derivative somewhere)
(!Every differentiable function is periodic)

{{E}}
<br>

{{MC}}

'''How is convergence of an infinite series defined?'''
(The sequence of partial sums converges)
(!The individual terms are all nonzero)
(!The terms alternate in sign)
(!The sequence of terms is bounded above)

{{E}}
<br>

{{BR}}
== Memory Game ==

<div class="memo-quiz">
{|
|-
| Supremum || Least upper bound of a set
|-
| Cauchy sequence || Sequence whose terms become arbitrarily close to each other
|-
| Compactness || Property equivalent to being closed and bounded in the real line
|-
| Uniform continuity || Continuity with one distance tolerance working across the domain
|-
| Subsequence || Sequence formed by retaining terms in their original order
|-
| Riemann integral || Integral defined through limits of finite partition sums
|-
| Connectedness || Property that characterizes intervals in the real line
|-
| Counterexample || Example that disproves a universal claim
|}
{{E}}
<br>

{{BR}}
== Drag and Drop ==

<div class="lueckentext-quiz">

{| class="wikitable"
! Match the correct terms.
! Topic
|-
| '''Completeness'''
| Every Cauchy sequence of real numbers converges
|-
| '''Bolzano-Weierstrass theorem'''
| Every bounded real sequence has a convergent subsequence
|-
| '''Heine-Cantor theorem'''
| Continuous functions on compact sets are uniformly continuous
|-
| '''Intermediate Value Theorem'''
| Continuous functions on intervals attain intermediate values
|-
| '''Mean Value Theorem'''
| A derivative equals an average rate of change at some interior point
|}
{{E}}

<br>
...
<br />

{{BR}}
== Crossword Puzzle ==

<div class="kreuzwort-quiz">
{|
|-
| Supremum || What is the least upper bound of a set called?
|-
| Cauchy || Which kind of sequence has terms that become arbitrarily close to each other?
|-
| Compactness || Which property is equivalent to closedness and boundedness for subsets of the real line?
|-
| Continuity || Which property means small input changes produce controlled output changes near a point?
|-
| Derivative || What object represents the limiting local rate of change of a function?
|-
| Integrable || What adjective describes a bounded function whose Riemann upper and lower integrals agree?
|}
{{E}}
<br>

{{BR}}
== LearningApps ==

<iframe> https://learningapps.org/index.php?s=Real+Analysis </iframe>

{{BR}}
== Cloze Text ==

<quiz display=simple>
{'''Complete the text.'''<br>
|type="{}"}
The real numbers are distinguished from the rationals by { completeness }. A convergent sequence must eventually stay arbitrarily close to its { limit }. A sequence whose terms become arbitrarily close to one another is called { Cauchy }. The epsilon-delta definition gives a precise meaning to a function { limit }. A continuous function on a compact set is { uniformly continuous }. In the real line, a set is compact exactly when it is closed and { bounded }. The Mean Value Theorem connects a derivative with an average rate of { change }. The Riemann integral is built from finite sums over { partitions }.
</quiz>

<br>

{{BR}}
= Open-Ended Tasks =

{{BR}}
=== Easy ===
# [[English:Proof vocabulary|Proof vocabulary]]: Create a one-page glossary that explains implication, converse, contrapositive, contradiction, counterexample, necessary condition, and sufficient condition in your own words, with one original mathematical example for each term.
# [[English:Sequence experiment|Sequence experiment]]: Use a spreadsheet, graphing tool, or short program to plot the first fifty terms of three sequences, then write a paragraph explaining which appear to converge and what a rigorous proof would still need to establish.
# [[English:Epsilon neighborhood|Epsilon neighborhood]]: Draw or digitally design a visual explanation of sequence convergence that marks an epsilon-neighborhood of a proposed limit and highlights the index after which all terms remain inside it.
# [[English:Continuity interview|Continuity interview]]: Interview a classmate about the difference between continuity and uniform continuity, then revise the explanation until it correctly identifies what the delta may depend on.

{{BR}}
=== Standard ===
# [[English:Epsilon-delta proof|Epsilon-delta proof]]: Produce a complete epsilon-delta proof for a linear or quadratic function limit, and annotate each line to explain why the chosen delta works.
# [[English:Counterexample collection|Counterexample collection]]: Build a mini-gallery of four counterexamples showing that a weakened hypothesis can break a familiar theorem, including one example about continuity, one about compactness, one about series, and one about differentiability.
# [[English:Bolzano-Weierstrass visualization|Bolzano-Weierstrass visualization]]: Create a diagram or short video that demonstrates interval bisection for a bounded sequence and explains how an infinite subsequence is selected.
# [[English:Riemann sum investigation|Riemann sum investigation]]: Approximate the integral of a continuous function numerically using left, right, and midpoint sums for increasingly fine partitions, then compare the numerical evidence with the definition of Riemann integrability.

{{BR}}
=== Advanced ===
# [[English:Cantor set project|Cantor set project]]: Generate several stages of the Cantor set, estimate the total removed length, and write a proof-oriented explanation of why the remaining set is uncountable but contains no interval.
# [[English:Uniform convergence|Uniform convergence]]: Investigate a sequence of continuous functions that converges pointwise but not uniformly, create a graph or animation, and explain which property of the limit exposes the failure of uniform convergence.
# [[English:Compactness proof comparison|Compactness proof comparison]]: Write two proofs of one theorem on a closed bounded interval, one using sequences and one using open covers or nested intervals, then compare the logical structure and assumptions.
# [[English:Analysis in practice|Analysis in practice]]: Interview a researcher, engineer, economist, physicist, or data scientist about where limiting arguments or error bounds enter their work, then connect the interview to at least two rigorous ideas from this course.

{{:Open Task - Create a MOOC}}

{{BR}}
= Learning Assessment =

# [[English:Proof of convergence|Proof of convergence]]: Prove that a specified monotone bounded sequence converges, and identify exactly where completeness of the real numbers enters the argument.
# [[English:Limit transfer|Limit transfer]]: Given an epsilon-delta limit statement, translate it into a sequential statement, prove one direction of the equivalence, and explain how the sequential version can be used to disprove a false limit.
# [[English:Compactness application|Compactness application]]: Prove that a continuous function on a closed bounded interval attains a maximum, then construct an example showing why the conclusion can fail when compactness is removed.
# [[English:Uniform continuity reasoning|Uniform continuity reasoning]]: Determine whether several functions on different domains are uniformly continuous, justify each decision rigorously, and distinguish local continuity arguments from global estimates.
# [[English:Mean Value Theorem transfer|Mean Value Theorem transfer]]: Use the Mean Value Theorem to derive a nontrivial inequality or error estimate, and explain why each hypothesis of the theorem is needed.
# [[English:Riemann integrability argument|Riemann integrability argument]]: Show that a given bounded function is Riemann integrable or not integrable by controlling upper and lower sums, and connect the proof to oscillation on small intervals.

<br>
<br>

{{BR}}
= Evidence of Learning =

A strong portfolio for this aiMOOC should show four kinds of evidence.

{| class="wikitable"
! Area
! Evidence
|-
| '''Knowledge'''
| You can state and interpret core definitions and theorems involving completeness, convergence, continuity, compactness, differentiation, and Riemann integration.
|-
| '''Proof skills'''
| You can unpack quantifiers, choose useful estimates, construct subsequences, use contradiction and contrapositive arguments, and test claims with counterexamples.
|-
| '''Products'''
| You can produce rigorous written proofs, annotated diagrams, computational experiments, explanatory videos, or short mathematical reports that connect intuition with definitions.
|-
| '''Transfer'''
| You can recognize when a new problem is controlled by completeness, compactness, continuity, convergence, or an error estimate, and select an appropriate theorem or proof strategy.
|}

<br>
<br>

{{BR}}
= OERs on the Topic =

The English Wikipedia article on [[English:Real analysis|Real analysis]] provides a broad reference map for the subject and links to related areas.

<iframe> https://en.m.wikipedia.org/wiki/Real_analysis </iframe>

For deeper study, the MIT OpenCourseWare lectures embedded throughout this aiMOOC provide university-level explanations and proofs. You can use them to compare proof styles, revisit difficult definitions, and see how the topics fit into a full real-analysis course.

<br>

{{BR}}
= Linked Learning Areas =

Real analysis links the logic of proof with the rigorous foundations of calculus. Its central ideas are the completeness of the real numbers, convergence of sequences and series, epsilon-delta limits, continuity and uniform continuity, compactness and connectedness, differentiation, and Riemann integration. These ideas form a bridge to topology, measure theory, probability, differential equations, numerical analysis, optimization, and functional analysis.

{| align=center
{{:D-Tab}}
'''[[English:Real Analysis|Real Analysis]]'''
# [[English:Real numbers|Real numbers]]
# [[English:Completeness|Completeness]]
# [[English:Sequences|Sequences]]
# [[English:Series|Series]]
# [[English:Limits|Limits]]
# [[English:Continuity|Continuity]]
# [[English:Uniform continuity|Uniform continuity]]
# [[English:Compactness|Compactness]]
# [[English:Connectedness|Connectedness]]
# [[English:Differentiation|Differentiation]]
# [[English:Riemann integral|Riemann integral]]
# [[English:Mathematical proof|Mathematical proof]]
|}

[[Category:English]]
[[Category:Real Analysis]]
[[Category:Higher Education]]
[[Category:Mathematics]]
[[Category:Mathematical Analysis]]
[[Category:Calculus]]
[[Category:Sequences and Series]]
[[Category:Mathematical Proof]]
[[Category:AI_MOOC]]
[[Category:GPT aiMOOC]]

{{BR}}
= aiMOOC Projects =
[[Category:AI_MOOC]] [[Category:GPT aiMOOC]]
{{MT}}

English:Real Analysis - Versionsgeschichte

Glanz: aiMOOC über GPT aiMOOC Action erstellt