<![CDATA[MKLab - CALCULUS AND ANALYSIS]]> https://mklab.gr/ Sun, 13 Sep 2026 13:30:16 +0000 MyBB <![CDATA[Cardinality]]> https://mklab.gr/showthread.php?tid=1899 Tue, 08 Sep 2026 02:17:34 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1899 Summary:

Cardinality is the mathematical notion used to describe the size of a set, including both finite and infinite sets. For a finite set $A$, its cardinality $|A|$ is simply the number of elements it contains. More generally, two sets $A$ and $B$ have the same cardinality if there exists a bijection between them—a one-to-one correspondence pairing every element of $A$ with exactly one element of $B$. This definition produces a striking feature of infinite sets: a proper subset can have the same cardinality as the whole set. For example, the natural numbers $\mathbb N$ and the even numbers have the same cardinality because $f(n)=2n$ gives a bijection between them. 

Infinite sets are divided into countable and uncountable ones. The natural numbers, integers, and rational numbers are countably infinite and have cardinality $\aleph_0$. In contrast, Cantor's diagonal argument shows that the real numbers $\mathbb R$ are uncountable and therefore form a strictly larger infinity. More generally, Cantor's theorem says that for every set $A$, its power set $\mathcal P(A)$ has strictly greater cardinality than $A$, producing an endless hierarchy of increasingly large infinities. Cardinal numbers such as $\aleph_0,\aleph_1,\aleph_2,\ldots$ provide a systematic way of describing these different infinite sizes. 

One of the central questions arising from this theory is the Continuum Hypothesis (CH): whether the cardinality of the real numbers is exactly the next cardinal after $\aleph_0$, that is, whether $|\mathbb R|=\aleph_1$. Remarkably, Gödel and Cohen's work ultimately established that CH can neither be proved nor disproved from the standard Zermelo–Fraenkel axioms with the Axiom of Choice (ZFC), assuming those axioms are consistent. Cardinality, developed primarily from Georg Cantor's work in the late nineteenth century, consequently became one of the foundations of modern set theory and mathematical logic. 

Key takeaways
  • $|A|=|B|$ means that a bijection exists between $A$ and $B$.
  • $\mathbb N$, $\mathbb Z$, and $\mathbb Q$ have cardinality $\aleph_0$.
  • $\mathbb R$ is uncountable, so $|\mathbb R|>\aleph_0$.
  • Cantor's theorem $|A|<|\mathcal P(A)|$ shows that there is no largest infinity. 

ARTICLE]]> Summary:

Cardinality is the mathematical notion used to describe the size of a set, including both finite and infinite sets. For a finite set $A$, its cardinality $|A|$ is simply the number of elements it contains. More generally, two sets $A$ and $B$ have the same cardinality if there exists a bijection between them—a one-to-one correspondence pairing every element of $A$ with exactly one element of $B$. This definition produces a striking feature of infinite sets: a proper subset can have the same cardinality as the whole set. For example, the natural numbers $\mathbb N$ and the even numbers have the same cardinality because $f(n)=2n$ gives a bijection between them. 

Infinite sets are divided into countable and uncountable ones. The natural numbers, integers, and rational numbers are countably infinite and have cardinality $\aleph_0$. In contrast, Cantor's diagonal argument shows that the real numbers $\mathbb R$ are uncountable and therefore form a strictly larger infinity. More generally, Cantor's theorem says that for every set $A$, its power set $\mathcal P(A)$ has strictly greater cardinality than $A$, producing an endless hierarchy of increasingly large infinities. Cardinal numbers such as $\aleph_0,\aleph_1,\aleph_2,\ldots$ provide a systematic way of describing these different infinite sizes. 

One of the central questions arising from this theory is the Continuum Hypothesis (CH): whether the cardinality of the real numbers is exactly the next cardinal after $\aleph_0$, that is, whether $|\mathbb R|=\aleph_1$. Remarkably, Gödel and Cohen's work ultimately established that CH can neither be proved nor disproved from the standard Zermelo–Fraenkel axioms with the Axiom of Choice (ZFC), assuming those axioms are consistent. Cardinality, developed primarily from Georg Cantor's work in the late nineteenth century, consequently became one of the foundations of modern set theory and mathematical logic. 

Key takeaways
  • $|A|=|B|$ means that a bijection exists between $A$ and $B$.
  • $\mathbb N$, $\mathbb Z$, and $\mathbb Q$ have cardinality $\aleph_0$.
  • $\mathbb R$ is uncountable, so $|\mathbb R|>\aleph_0$.
  • Cantor's theorem $|A|<|\mathcal P(A)|$ shows that there is no largest infinity. 

ARTICLE]]> <![CDATA[Cantor's first set theory article]]> https://mklab.gr/showthread.php?tid=1898 Tue, 08 Sep 2026 02:14:34 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1898
Georg Cantor’s 1874 paper “On a Property of the Collection of All Real Algebraic Numbers” is generally regarded as the article that launched modern set theory. Cantor first proved that the set of real algebraic numbers is countable: they can be arranged in a sequence $x_1,x_2,x_3,\ldots$ and therefore put into one-to-one correspondence with the positive integers. His method orders integer polynomials according to a measure of their degree and coefficients and then lists their real roots. 

The paper's revolutionary step is Cantor's second theorem. Given any sequence of real numbers $x_1,x_2,x_3,\ldots$ and any interval $[a,b]$, Cantor constructs nested intervals and proves that there must exist a real number inside $[a,b]$ that is not contained in the sequence. Consequently, the real numbers cannot be enumerated by the natural numbers: $\mathbb{R}$ is uncountable. Importantly, this 1874 argument is not Cantor's later diagonal argument; it relies instead on nested intervals. Combining this result with the countability of the algebraic numbers also shows that every real interval contains infinitely many transcendental numbers. 

The paper fundamentally changed the mathematical understanding of infinity by demonstrating that infinite collections need not all have the same size. Cantor later formalized the comparison of infinite cardinalities and developed ordinal and cardinal arithmetic, while the notions of countability and uncountability became central to analysis, topology, measure theory, mathematical logic, and the foundations of mathematics. 

Key takeaways
  • Cantor proved that the algebraic numbers are countably infinite.
  • He proved that $\mathbb{R}$ is uncountable, establishing different sizes of infinity.
  • His original 1874 proof used nested intervals, not the famous diagonal argument.
  • The paper is widely considered the starting point of modern set theory. 

ARTICLE]]>
Georg Cantor’s 1874 paper “On a Property of the Collection of All Real Algebraic Numbers” is generally regarded as the article that launched modern set theory. Cantor first proved that the set of real algebraic numbers is countable: they can be arranged in a sequence $x_1,x_2,x_3,\ldots$ and therefore put into one-to-one correspondence with the positive integers. His method orders integer polynomials according to a measure of their degree and coefficients and then lists their real roots. 

The paper's revolutionary step is Cantor's second theorem. Given any sequence of real numbers $x_1,x_2,x_3,\ldots$ and any interval $[a,b]$, Cantor constructs nested intervals and proves that there must exist a real number inside $[a,b]$ that is not contained in the sequence. Consequently, the real numbers cannot be enumerated by the natural numbers: $\mathbb{R}$ is uncountable. Importantly, this 1874 argument is not Cantor's later diagonal argument; it relies instead on nested intervals. Combining this result with the countability of the algebraic numbers also shows that every real interval contains infinitely many transcendental numbers. 

The paper fundamentally changed the mathematical understanding of infinity by demonstrating that infinite collections need not all have the same size. Cantor later formalized the comparison of infinite cardinalities and developed ordinal and cardinal arithmetic, while the notions of countability and uncountability became central to analysis, topology, measure theory, mathematical logic, and the foundations of mathematics. 

Key takeaways
  • Cantor proved that the algebraic numbers are countably infinite.
  • He proved that $\mathbb{R}$ is uncountable, establishing different sizes of infinity.
  • His original 1874 proof used nested intervals, not the famous diagonal argument.
  • The paper is widely considered the starting point of modern set theory. 

ARTICLE]]> <![CDATA[Fourier Series Through the Lens of Linear Algebra]]> https://mklab.gr/showthread.php?tid=1887 Mon, 07 Sep 2026 23:11:45 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1887 Summary

The paper presents Fourier series as an infinite-dimensional version of familiar linear algebra. Instead of thinking of a function merely as a formula, it treats functions as vectors in a function space such as $L^2[-\ell,\ell]$, equipped with the inner product
$\displaystyle \langle f,g\rangle=\int_{-\ell}^{\ell}f(x)g(x),dx.$
The trigonometric functions $1,\cos(n\pi x/\ell),\sin(n\pi x/\ell)$ behave like mutually orthogonal basis vectors. Consequently, the Fourier coefficients are analogous to the coordinates of an ordinary vector obtained by orthogonal projection onto basis directions. Thus a Fourier expansion can be interpreted as
$\displaystyle f(x)\sim \frac{a_0}{2}+\sum_{n=1}^{\infty}\left(a_n\cos\frac{n\pi x}{\ell}+b_n\sin\frac{n\pi x}{\ell}\right),$
with the partial Fourier sums acting as increasingly accurate projections of $f$ onto finite-dimensional subspaces. The public description of the matching project says that the essay develops precisely this interpretation of Fourier series as projected linear combinations of periodic functions in $L^2$. 

The paper then asks how far the same linear-algebra viewpoint can be transferred to Taylor series. A Taylor expansion,
$\displaystyle f(x)=\sum_{n=0}^{\infty}\frac{f^{(n)}(a)}{n!}(x-a)^n,$
can also be regarded as expressing a function as a linear combination of the functions $1,(x-a),(x-a)^2,\ldots$ in a vector space of analytic functions. However, there is an important difference: the monomials are not an orthogonal basis in the same natural way that the Fourier functions are, and Taylor coefficients arise from derivatives rather than orthogonal projections. The comparison therefore leads naturally to questions of pointwise, uniform, and $L^2$ convergence. Linear algebra provides a powerful conceptual framework for understanding both series, but convergence ultimately requires ideas from real and functional analysis because the spaces involved are infinite-dimensional. The matching project description explicitly states that these three forms of convergence are used to compare Fourier and Taylor expansions. 

Key takeaways
  • Fourier series are essentially orthogonal projections in an infinite-dimensional vector space.
  • Fourier coefficients play the same role as the coordinates of a vector relative to an orthogonal basis.
  • Taylor series can also be interpreted as linear combinations in a function space, but their coefficients are not obtained through orthogonal projection.
  • The comparison shows both the power and the limits of linear algebra: understanding convergence requires analysis in addition to vector-space ideas.

ARTICLE]]> Summary

The paper presents Fourier series as an infinite-dimensional version of familiar linear algebra. Instead of thinking of a function merely as a formula, it treats functions as vectors in a function space such as $L^2[-\ell,\ell]$, equipped with the inner product
$\displaystyle \langle f,g\rangle=\int_{-\ell}^{\ell}f(x)g(x),dx.$
The trigonometric functions $1,\cos(n\pi x/\ell),\sin(n\pi x/\ell)$ behave like mutually orthogonal basis vectors. Consequently, the Fourier coefficients are analogous to the coordinates of an ordinary vector obtained by orthogonal projection onto basis directions. Thus a Fourier expansion can be interpreted as
$\displaystyle f(x)\sim \frac{a_0}{2}+\sum_{n=1}^{\infty}\left(a_n\cos\frac{n\pi x}{\ell}+b_n\sin\frac{n\pi x}{\ell}\right),$
with the partial Fourier sums acting as increasingly accurate projections of $f$ onto finite-dimensional subspaces. The public description of the matching project says that the essay develops precisely this interpretation of Fourier series as projected linear combinations of periodic functions in $L^2$. 

The paper then asks how far the same linear-algebra viewpoint can be transferred to Taylor series. A Taylor expansion,
$\displaystyle f(x)=\sum_{n=0}^{\infty}\frac{f^{(n)}(a)}{n!}(x-a)^n,$
can also be regarded as expressing a function as a linear combination of the functions $1,(x-a),(x-a)^2,\ldots$ in a vector space of analytic functions. However, there is an important difference: the monomials are not an orthogonal basis in the same natural way that the Fourier functions are, and Taylor coefficients arise from derivatives rather than orthogonal projections. The comparison therefore leads naturally to questions of pointwise, uniform, and $L^2$ convergence. Linear algebra provides a powerful conceptual framework for understanding both series, but convergence ultimately requires ideas from real and functional analysis because the spaces involved are infinite-dimensional. The matching project description explicitly states that these three forms of convergence are used to compare Fourier and Taylor expansions. 

Key takeaways
  • Fourier series are essentially orthogonal projections in an infinite-dimensional vector space.
  • Fourier coefficients play the same role as the coordinates of a vector relative to an orthogonal basis.
  • Taylor series can also be interpreted as linear combinations in a function space, but their coefficients are not obtained through orthogonal projection.
  • The comparison shows both the power and the limits of linear algebra: understanding convergence requires analysis in addition to vector-space ideas.

ARTICLE]]> <![CDATA[A proof of Riemann Hypothesis ?]]> https://mklab.gr/showthread.php?tid=1867 Sun, 06 Sep 2026 00:47:08 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1867 Quote:
This not  an accepted proof of the Riemann Hypothesis. As of September 2026, the Clay Mathematics Institute still officially lists the Riemann Hypothesis as unsolved, which decisively tells us that de Branges's 2017 manuscript has not achieved general mathematical acceptance.
The reason for mentioning his proof of RH is to expose the level of sophistication involved.

Louis de Branges de Bourcia (born August 21, 1932) is a French-American mathematician. He was the Edward C. Elliott Distinguished Professor of Mathematics at Purdue University in West Lafayette, Indiana, retiring in 2023. He is best known for proving the long-standing Bieberbach conjecture in 1984,

summary

Louis de Branges’s 89-page 2017 manuscript claims a proof of the Riemann Hypothesis by placing the Riemann zeta function inside a much broader framework involving Hilbert spaces of entire functions, weighted Hardy/Stieltjes spaces, harmonic and Fourier analysis, quaternionic or “skew-plane” structures, adelic constructions, and Hecke operators. He constructs generalized zeta functions whose Dirichlet-series coefficients arise as eigenfunctions of Hecke operators and argues that their zero distributions can be controlled through the maximal accretive property of a Radon transformation: in the nonsingular case this property is supposed to imply the corresponding Riemann hypothesis directly, while in the singular case a parity decomposition is used to remove the obstruction. The classical Euler–Riemann zeta function $\zeta(s)$ is then claimed as a special case, which would imply that every nontrivial zero satisfies $\operatorname{Re}(s)=\tfrac12$.

ARTICLE [PDF]]]> Quote:
This not  an accepted proof of the Riemann Hypothesis. As of September 2026, the Clay Mathematics Institute still officially lists the Riemann Hypothesis as unsolved, which decisively tells us that de Branges's 2017 manuscript has not achieved general mathematical acceptance.
The reason for mentioning his proof of RH is to expose the level of sophistication involved.

Louis de Branges de Bourcia (born August 21, 1932) is a French-American mathematician. He was the Edward C. Elliott Distinguished Professor of Mathematics at Purdue University in West Lafayette, Indiana, retiring in 2023. He is best known for proving the long-standing Bieberbach conjecture in 1984,

summary

Louis de Branges’s 89-page 2017 manuscript claims a proof of the Riemann Hypothesis by placing the Riemann zeta function inside a much broader framework involving Hilbert spaces of entire functions, weighted Hardy/Stieltjes spaces, harmonic and Fourier analysis, quaternionic or “skew-plane” structures, adelic constructions, and Hecke operators. He constructs generalized zeta functions whose Dirichlet-series coefficients arise as eigenfunctions of Hecke operators and argues that their zero distributions can be controlled through the maximal accretive property of a Radon transformation: in the nonsingular case this property is supposed to imply the corresponding Riemann hypothesis directly, while in the singular case a parity decomposition is used to remove the obstruction. The classical Euler–Riemann zeta function $\zeta(s)$ is then claimed as a special case, which would imply that every nontrivial zero satisfies $\operatorname{Re}(s)=\tfrac12$.

ARTICLE [PDF]]]> <![CDATA[Sophomore's dream]]> https://mklab.gr/showthread.php?tid=1800 Thu, 03 Sep 2026 02:32:15 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1800
The Sophomore’s Dream refers to two remarkable identities connecting definite integrals with infinite series:
$\int_0^1 x^{-x},dx=\sum_{n=1}^{\infty} n^{-n}$
and
$\int_0^1 x^{x},dx=\sum_{n=1}^{\infty}(-1)^{n+1}n^{-n}$.
Their numerical values are approximately $1.291285997\ldots$ and $0.783430511\ldots$, respectively. The identities were discovered by Johann Bernoulli in 1697. The playful name “Sophomore’s Dream” contrasts with the “Freshman’s Dream,” the generally false formula $(x+y)^n=x^n+y^n$. Unlike that tempting but incorrect identity, the Sophomore’s Dream formulas really are true.

The proof begins by rewriting $x^x$ as $e^{x\log x}$ and expanding the exponential into its power series:
$x^x=\sum_{n=0}^{\infty}\frac{x^n(\log x)^n}{n!}$.
After interchanging summation and integration, the problem reduces to calculating integrals of the form $\int_0^1x^n(\log x)^n,dx$. Using a substitution and the Gamma-function identity $\Gamma(n+1)=n!$, one obtains
$\int_0^1\frac{x^n(\log x)^n}{n!},dx=(-1)^n(n+1)^{-(n+1)}$,
which produces the alternating series above. The corresponding calculation for $x^{-x}$ gives the positive series $\sum_{n=1}^{\infty}n^{-n}$. Bernoulli’s original proof predates the Gamma function and instead evaluated the necessary integrals repeatedly using integration by parts.

Key takeaways
  • The Sophomore’s Dream gives a surprising exact relationship between integrals, exponential functions, and rapidly convergent infinite series.
  • The central technique is the expansion $x^x=e^{x\log x}$ followed by term-by-term integration.
  • The proof naturally connects elementary calculus with the Gamma function and factorials.
  • The result is historically significant: Bernoulli discovered it in 1697, long before the modern Gamma-function formulation.

ARTICLE]]>
The Sophomore’s Dream refers to two remarkable identities connecting definite integrals with infinite series:
$\int_0^1 x^{-x},dx=\sum_{n=1}^{\infty} n^{-n}$
and
$\int_0^1 x^{x},dx=\sum_{n=1}^{\infty}(-1)^{n+1}n^{-n}$.
Their numerical values are approximately $1.291285997\ldots$ and $0.783430511\ldots$, respectively. The identities were discovered by Johann Bernoulli in 1697. The playful name “Sophomore’s Dream” contrasts with the “Freshman’s Dream,” the generally false formula $(x+y)^n=x^n+y^n$. Unlike that tempting but incorrect identity, the Sophomore’s Dream formulas really are true.

The proof begins by rewriting $x^x$ as $e^{x\log x}$ and expanding the exponential into its power series:
$x^x=\sum_{n=0}^{\infty}\frac{x^n(\log x)^n}{n!}$.
After interchanging summation and integration, the problem reduces to calculating integrals of the form $\int_0^1x^n(\log x)^n,dx$. Using a substitution and the Gamma-function identity $\Gamma(n+1)=n!$, one obtains
$\int_0^1\frac{x^n(\log x)^n}{n!},dx=(-1)^n(n+1)^{-(n+1)}$,
which produces the alternating series above. The corresponding calculation for $x^{-x}$ gives the positive series $\sum_{n=1}^{\infty}n^{-n}$. Bernoulli’s original proof predates the Gamma function and instead evaluated the necessary integrals repeatedly using integration by parts.

Key takeaways
  • The Sophomore’s Dream gives a surprising exact relationship between integrals, exponential functions, and rapidly convergent infinite series.
  • The central technique is the expansion $x^x=e^{x\log x}$ followed by term-by-term integration.
  • The proof naturally connects elementary calculus with the Gamma function and factorials.
  • The result is historically significant: Bernoulli discovered it in 1697, long before the modern Gamma-function formulation.

ARTICLE]]> <![CDATA[Borwein integral]]> https://mklab.gr/showthread.php?tid=1799 Thu, 03 Sep 2026 02:25:01 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1799
A Borwein integral is a definite integral involving products of sinc functions, where
$\operatorname{sinc}(x)=\dfrac{\sin x}{x}$.
They were highlighted by mathematicians David and Jonathan Borwein because they exhibit a striking phenomenon: a simple numerical pattern remains true for several successive integrals and then suddenly fails by an extremely tiny amount. For example,
$\int_0^\infty \frac{\sin x}{x}\frac{\sin(x/3)}{x/3}\frac{\sin(x/5)}{x/5}\cdots\frac{\sin(x/13)}{x/13},dx=\frac{\pi}{2}$.
The same value occurs when fewer factors are included. However, after adding the next factor,
$\dfrac{\sin(x/15)}{x/15}$,
the result becomes slightly smaller than $\dfrac{\pi}{2}$, differing by only about
$2.31\times10^{-11}$.
The explanation comes from a general condition. For integrals of the form
$\int_0^\infty \prod_{k=0}^{n}\frac{\sin(a_kx)}{a_kx},dx$,
the value remains
$\frac{\pi}{2a_0}$
when $a_0$ is larger than the sum of the magnitudes of the remaining parameters.

In the classical example, this corresponds to the reciprocal sum
$\frac13+\frac15+\frac17+\cdots+\frac1{13}<1$.
Adding $\frac1{15}$ makes the sum exceed $1$, causing the pattern to break. The deviation is initially extremely small because the correction term involves a high power of the amount by which the threshold has been exceeded.
Related versions containing $2\cos x$ maintain the apparent pattern much longer. In one famous case, the breakdown occurring after the factor involving $113$ is only about
$2.3\times10^{-138}$.

Borwein integrals also connect several areas of mathematics. They can be studied through Fourier analysis, exact integration methods, infinite products, and probability. One particularly elegant interpretation connects them with random walks and the random harmonic series
$\pm1\pm\frac12\pm\frac13\pm\frac14\pm\cdots$,
where the signs are chosen independently at random.
These interpretations help explain why the apparently perfect pattern eventually fails and make Borwein integrals a famous example of how convincing numerical evidence can conceal a subtle mathematical threshold.

Key takeaways
  • Borwein integrals are products of sinc functions with unexpectedly simple values.
  • Many consecutive examples equal exactly $\frac{\pi}{2}$ before the pattern suddenly fails.
  • The critical point occurs when a certain sum of parameters crosses a threshold.
  • They are a classic lesson in experimental mathematics: even an extremely convincing numerical pattern is not necessarily a theorem.



ARTICLE]]>
A Borwein integral is a definite integral involving products of sinc functions, where
$\operatorname{sinc}(x)=\dfrac{\sin x}{x}$.
They were highlighted by mathematicians David and Jonathan Borwein because they exhibit a striking phenomenon: a simple numerical pattern remains true for several successive integrals and then suddenly fails by an extremely tiny amount. For example,
$\int_0^\infty \frac{\sin x}{x}\frac{\sin(x/3)}{x/3}\frac{\sin(x/5)}{x/5}\cdots\frac{\sin(x/13)}{x/13},dx=\frac{\pi}{2}$.
The same value occurs when fewer factors are included. However, after adding the next factor,
$\dfrac{\sin(x/15)}{x/15}$,
the result becomes slightly smaller than $\dfrac{\pi}{2}$, differing by only about
$2.31\times10^{-11}$.
The explanation comes from a general condition. For integrals of the form
$\int_0^\infty \prod_{k=0}^{n}\frac{\sin(a_kx)}{a_kx},dx$,
the value remains
$\frac{\pi}{2a_0}$
when $a_0$ is larger than the sum of the magnitudes of the remaining parameters.

In the classical example, this corresponds to the reciprocal sum
$\frac13+\frac15+\frac17+\cdots+\frac1{13}<1$.
Adding $\frac1{15}$ makes the sum exceed $1$, causing the pattern to break. The deviation is initially extremely small because the correction term involves a high power of the amount by which the threshold has been exceeded.
Related versions containing $2\cos x$ maintain the apparent pattern much longer. In one famous case, the breakdown occurring after the factor involving $113$ is only about
$2.3\times10^{-138}$.

Borwein integrals also connect several areas of mathematics. They can be studied through Fourier analysis, exact integration methods, infinite products, and probability. One particularly elegant interpretation connects them with random walks and the random harmonic series
$\pm1\pm\frac12\pm\frac13\pm\frac14\pm\cdots$,
where the signs are chosen independently at random.
These interpretations help explain why the apparently perfect pattern eventually fails and make Borwein integrals a famous example of how convincing numerical evidence can conceal a subtle mathematical threshold.

Key takeaways
  • Borwein integrals are products of sinc functions with unexpectedly simple values.
  • Many consecutive examples equal exactly $\frac{\pi}{2}$ before the pattern suddenly fails.
  • The critical point occurs when a certain sum of parameters crosses a threshold.
  • They are a classic lesson in experimental mathematics: even an extremely convincing numerical pattern is not necessarily a theorem.



ARTICLE]]> <![CDATA[Harmonic series]]> https://mklab.gr/showthread.php?tid=1783 Wed, 02 Sep 2026 00:10:58 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1783
The harmonic series is the infinite sum
$\displaystyle \sum_{n=1}^{\infty}\frac1n=1+\frac12+\frac13+\frac14+\cdots.$
Although its terms $\frac1n$ approach $0$, the series itself diverges: its partial sums grow without bound. This is one of the classic examples showing that the condition $a_n\to0$ is necessary but not sufficient for $\sum a_n$ to converge. A famous proof, essentially due to Nicole Oresme around 1350, groups the terms in blocks whose sizes double. Each block contributes at least $\frac12$, producing infinitely many such contributions. Divergence also follows from the integral test because $\displaystyle \int_1^\infty\frac{dx}{x}=\infty$. 

The first $n$ terms form the harmonic number
$\displaystyle H_n=\sum_{k=1}^n\frac1k.$
Despite divergence, these partial sums grow extraordinarily slowly. Their asymptotic behaviour is
$\displaystyle H_n=\ln n+\gamma+\frac{1}{2n}+O!\left(\frac1{n^2}\right),$
where $\gamma\approx0.57721$ is the Euler–Mascheroni constant. Thus $H_n\sim\ln n$: doubling or even multiplying $n$ enormously produces only modest increases in the sum. For example, $H_{10}\approx2.929$, illustrating just how slowly the divergence occurs. 

The harmonic series appears throughout mathematics and computer science. Harmonic numbers arise in the block-stacking problem, where $n$ blocks can overhang a table by $\frac12H_n$ block lengths, in desert-crossing and fuel-depot problems, in probability problems such as the coupon collector problem, in number theory involving primes, and in the average-case analysis of algorithms such as quicksort. The series is therefore important not only as a basic example in mathematical analysis, but as a structure that repeatedly appears whenever increasingly small contributions accumulate over many stages. 

Key takeaways
  • Terms tending to zero do not guarantee convergence: $\frac1n\to0$, yet $\sum 1/n$ diverges.
  • The divergence is extremely slow, since $H_n\approx\ln n+\gamma$.
  • Oresme's grouping argument gives a particularly elegant proof of divergence.
  • Harmonic numbers appear naturally in analysis, number theory, probability, combinatorics and algorithms. 

ARTICLE]]>
The harmonic series is the infinite sum
$\displaystyle \sum_{n=1}^{\infty}\frac1n=1+\frac12+\frac13+\frac14+\cdots.$
Although its terms $\frac1n$ approach $0$, the series itself diverges: its partial sums grow without bound. This is one of the classic examples showing that the condition $a_n\to0$ is necessary but not sufficient for $\sum a_n$ to converge. A famous proof, essentially due to Nicole Oresme around 1350, groups the terms in blocks whose sizes double. Each block contributes at least $\frac12$, producing infinitely many such contributions. Divergence also follows from the integral test because $\displaystyle \int_1^\infty\frac{dx}{x}=\infty$. 

The first $n$ terms form the harmonic number
$\displaystyle H_n=\sum_{k=1}^n\frac1k.$
Despite divergence, these partial sums grow extraordinarily slowly. Their asymptotic behaviour is
$\displaystyle H_n=\ln n+\gamma+\frac{1}{2n}+O!\left(\frac1{n^2}\right),$
where $\gamma\approx0.57721$ is the Euler–Mascheroni constant. Thus $H_n\sim\ln n$: doubling or even multiplying $n$ enormously produces only modest increases in the sum. For example, $H_{10}\approx2.929$, illustrating just how slowly the divergence occurs. 

The harmonic series appears throughout mathematics and computer science. Harmonic numbers arise in the block-stacking problem, where $n$ blocks can overhang a table by $\frac12H_n$ block lengths, in desert-crossing and fuel-depot problems, in probability problems such as the coupon collector problem, in number theory involving primes, and in the average-case analysis of algorithms such as quicksort. The series is therefore important not only as a basic example in mathematical analysis, but as a structure that repeatedly appears whenever increasingly small contributions accumulate over many stages. 

Key takeaways
  • Terms tending to zero do not guarantee convergence: $\frac1n\to0$, yet $\sum 1/n$ diverges.
  • The divergence is extremely slow, since $H_n\approx\ln n+\gamma$.
  • Oresme's grouping argument gives a particularly elegant proof of divergence.
  • Harmonic numbers appear naturally in analysis, number theory, probability, combinatorics and algorithms. 

ARTICLE]]> <![CDATA[Fourier transform]]> https://mklab.gr/showthread.php?tid=1779 Tue, 01 Sep 2026 23:49:36 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1779
The Fourier transform is one of the fundamental tools of mathematical analysis. Its central idea is that a function or signal can be represented not only in its original variable—such as time or position—but also in terms of the frequencies from which it is composed. In a standard convention, for an integrable function $f(x)$,
$\widehat{f}(\xi)=\int_{-\infty}^{\infty} f(x)e^{-i2\pi \xi x},dx.$
Here, $\widehat{f}(\xi)$ measures the contribution of frequency $\xi$ to the original function. An inverse Fourier transform can reconstruct $f$ from its frequency representation:
$f(x)=\int_{-\infty}^{\infty}\widehat{f}(\xi)e^{i2\pi \xi x},d\xi.$
A useful analogy is a musical chord: the original sound is a complicated waveform, while its Fourier transform reveals the individual frequencies or pitches that make up the sound and their relative strengths.

The Fourier transform has several powerful mathematical properties. It is linear, converts translations and scalings into simple transformations in the frequency domain, and—most importantly—turns differentiation into multiplication and convolution into ordinary multiplication. This often converts difficult differential or integral problems into much simpler algebraic ones.
Parseval's and Plancherel's theorems show that, under suitable conditions, the transform preserves quantities such as $L^2$ energy:
$\int_{-\infty}^{\infty}|f(x)|^2,dx=\int_{-\infty}^{\infty}|\widehat{f}(\xi)|^2,d\xi.$
There is also an important time–frequency trade-off: a function that is highly localized in time tends to have a Fourier transform spread over many frequencies, while a function concentrated in frequency tends to be spread out in time. This principle is closely connected to the mathematical uncertainty principle.

The Fourier transform has exceptionally broad applications. It was historically motivated by Joseph Fourier's study of the heat equation, but today it is central to solving partial differential equations, signal and image processing, telecommunications, spectroscopy, MRI, probability theory, and quantum mechanics. In quantum mechanics, for example, the position-space and momentum-space descriptions of a particle are related through a Fourier transform.
For digital data, the related Discrete Fourier Transform (DFT) is commonly used. If a sequence contains $N$ values $x_0,x_1,\ldots,x_{N-1}$, its DFT can be written as
$X_k=\sum_{n=0}^{N-1}x_n e^{-i2\pi kn/N},\qquad k=0,1,\ldots,N-1.$
The DFT can be calculated efficiently using the Fast Fourier Transform (FFT) algorithm, making Fourier analysis practical for enormous datasets and real-time signals.

Key Takeaways
  • Main idea: Fourier analysis decomposes complicated functions or signals into combinations of simple oscillations or frequencies.
  • Central formula: $\widehat{f}(\xi)=\int_{-\infty}^{\infty}f(x)e^{-i2\pi\xi x},dx$.
  • Inverse transform: $f(x)=\int_{-\infty}^{\infty}\widehat{f}(\xi)e^{i2\pi\xi x},d\xi$.
  • Major advantage: differentiation and convolution become much simpler operations in frequency space.
  • Applications: differential equations, sound, images, communications, spectroscopy, MRI, probability theory, and quantum mechanics.
  • Computational version: the DFT and FFT allow Fourier analysis to be applied efficiently to digital data.

ARTICLE]]>
The Fourier transform is one of the fundamental tools of mathematical analysis. Its central idea is that a function or signal can be represented not only in its original variable—such as time or position—but also in terms of the frequencies from which it is composed. In a standard convention, for an integrable function $f(x)$,
$\widehat{f}(\xi)=\int_{-\infty}^{\infty} f(x)e^{-i2\pi \xi x},dx.$
Here, $\widehat{f}(\xi)$ measures the contribution of frequency $\xi$ to the original function. An inverse Fourier transform can reconstruct $f$ from its frequency representation:
$f(x)=\int_{-\infty}^{\infty}\widehat{f}(\xi)e^{i2\pi \xi x},d\xi.$
A useful analogy is a musical chord: the original sound is a complicated waveform, while its Fourier transform reveals the individual frequencies or pitches that make up the sound and their relative strengths.

The Fourier transform has several powerful mathematical properties. It is linear, converts translations and scalings into simple transformations in the frequency domain, and—most importantly—turns differentiation into multiplication and convolution into ordinary multiplication. This often converts difficult differential or integral problems into much simpler algebraic ones.
Parseval's and Plancherel's theorems show that, under suitable conditions, the transform preserves quantities such as $L^2$ energy:
$\int_{-\infty}^{\infty}|f(x)|^2,dx=\int_{-\infty}^{\infty}|\widehat{f}(\xi)|^2,d\xi.$
There is also an important time–frequency trade-off: a function that is highly localized in time tends to have a Fourier transform spread over many frequencies, while a function concentrated in frequency tends to be spread out in time. This principle is closely connected to the mathematical uncertainty principle.

The Fourier transform has exceptionally broad applications. It was historically motivated by Joseph Fourier's study of the heat equation, but today it is central to solving partial differential equations, signal and image processing, telecommunications, spectroscopy, MRI, probability theory, and quantum mechanics. In quantum mechanics, for example, the position-space and momentum-space descriptions of a particle are related through a Fourier transform.
For digital data, the related Discrete Fourier Transform (DFT) is commonly used. If a sequence contains $N$ values $x_0,x_1,\ldots,x_{N-1}$, its DFT can be written as
$X_k=\sum_{n=0}^{N-1}x_n e^{-i2\pi kn/N},\qquad k=0,1,\ldots,N-1.$
The DFT can be calculated efficiently using the Fast Fourier Transform (FFT) algorithm, making Fourier analysis practical for enormous datasets and real-time signals.

Key Takeaways
  • Main idea: Fourier analysis decomposes complicated functions or signals into combinations of simple oscillations or frequencies.
  • Central formula: $\widehat{f}(\xi)=\int_{-\infty}^{\infty}f(x)e^{-i2\pi\xi x},dx$.
  • Inverse transform: $f(x)=\int_{-\infty}^{\infty}\widehat{f}(\xi)e^{i2\pi\xi x},d\xi$.
  • Major advantage: differentiation and convolution become much simpler operations in frequency space.
  • Applications: differential equations, sound, images, communications, spectroscopy, MRI, probability theory, and quantum mechanics.
  • Computational version: the DFT and FFT allow Fourier analysis to be applied efficiently to digital data.

ARTICLE]]> <![CDATA[Internal set theory]]> https://mklab.gr/showthread.php?tid=1778 Tue, 01 Sep 2026 23:43:54 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1778
Internal Set Theory (IST) is a version of set theory introduced by Edward Nelson in 1977 to give an axiomatic foundation for nonstandard analysis, especially the rigorous use of infinitesimal and infinitely large quantities. Rather than constructing an enlarged number system, as in Abraham Robinson’s nonstandard analysis, IST keeps the ordinary universe of sets and extends ZFC set theory by adding a new unary predicate $\operatorname{st}(x)$, meaning “$x$ is standard.” Formulas that do not use this predicate are called internal, while those involving it are external. This distinction allows ordinary real and natural numbers to include elements that behave like infinitely large numbers and infinitesimals without introducing a separate set of hyperreal numbers. 

IST adds three axiom schemes to ZFC: Idealisation, Standardisation, and Transfer—hence the initials I–S–T. Idealisation guarantees the existence of nonstandard elements; for example, it implies that there exists a natural number $N$ satisfying $N>n$ for every standard natural number $n$. Consequently, $1/N$ behaves as a positive infinitesimal. Standardisation allows one to associate suitable standard sets with properties that may involve the standard/nonstandard distinction. Transfer states, roughly, that an internal mathematical statement that holds for every standard object also holds for every object, provided its parameters are standard. This ensures that ordinary algebraic and analytic laws continue to apply to nonstandard numbers. 

A particularly important feature is that IST is a conservative extension of ZFC: if an ordinary statement of classical set theory—that is, an internal formula—can be proved using IST, then it can already be proved in ZFC. Thus IST does not produce new classical theorems unavailable to ordinary set theory; instead, it supplies a different and often more intuitive language for reasoning about infinitesimals and infinite quantities. If ZFC is consistent, IST is also consistent.

Key takeaways
  • IST = ZFC + the predicate $\operatorname{st}(x)$ + three axiom schemes: Idealisation, Standardisation and Transfer.
  • It makes rigorous statements involving infinitesimals and infinitely large natural numbers possible without explicitly constructing the hyperreal numbers.
  • A nonstandard natural number $N$ may satisfy $N>n$ for every standard $n\in\mathbb N$, making $1/N$ infinitesimal.
  • IST belongs mainly to mathematical logic, set theory, and nonstandard analysis, and is a conservative extension of ordinary ZFC. 

ARTICLE]]>
Internal Set Theory (IST) is a version of set theory introduced by Edward Nelson in 1977 to give an axiomatic foundation for nonstandard analysis, especially the rigorous use of infinitesimal and infinitely large quantities. Rather than constructing an enlarged number system, as in Abraham Robinson’s nonstandard analysis, IST keeps the ordinary universe of sets and extends ZFC set theory by adding a new unary predicate $\operatorname{st}(x)$, meaning “$x$ is standard.” Formulas that do not use this predicate are called internal, while those involving it are external. This distinction allows ordinary real and natural numbers to include elements that behave like infinitely large numbers and infinitesimals without introducing a separate set of hyperreal numbers. 

IST adds three axiom schemes to ZFC: Idealisation, Standardisation, and Transfer—hence the initials I–S–T. Idealisation guarantees the existence of nonstandard elements; for example, it implies that there exists a natural number $N$ satisfying $N>n$ for every standard natural number $n$. Consequently, $1/N$ behaves as a positive infinitesimal. Standardisation allows one to associate suitable standard sets with properties that may involve the standard/nonstandard distinction. Transfer states, roughly, that an internal mathematical statement that holds for every standard object also holds for every object, provided its parameters are standard. This ensures that ordinary algebraic and analytic laws continue to apply to nonstandard numbers. 

A particularly important feature is that IST is a conservative extension of ZFC: if an ordinary statement of classical set theory—that is, an internal formula—can be proved using IST, then it can already be proved in ZFC. Thus IST does not produce new classical theorems unavailable to ordinary set theory; instead, it supplies a different and often more intuitive language for reasoning about infinitesimals and infinite quantities. If ZFC is consistent, IST is also consistent.

Key takeaways
  • IST = ZFC + the predicate $\operatorname{st}(x)$ + three axiom schemes: Idealisation, Standardisation and Transfer.
  • It makes rigorous statements involving infinitesimals and infinitely large natural numbers possible without explicitly constructing the hyperreal numbers.
  • A nonstandard natural number $N$ may satisfy $N>n$ for every standard $n\in\mathbb N$, making $1/N$ infinitesimal.
  • IST belongs mainly to mathematical logic, set theory, and nonstandard analysis, and is a conservative extension of ordinary ZFC. 

ARTICLE]]> <![CDATA[What makes a number system?]]> https://mklab.gr/showthread.php?tid=1772 Tue, 01 Sep 2026 01:46:15 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1772 What Makes a Number System? Author: Lukáš Lejdar
Topic: Number systems, geometry, normed division algebras, Hurwitz’s theorem

The article asks why the familiar sequence of number systems seems to jump through dimensions
$\mathbb{R};(1),\qquad \mathbb{C};(2),\qquad \mathbb{H};(4),\qquad \mathbb{O};(8)$
rather than continuing naturally through dimensions $3,5,6,\ldots$.
Its starting point is geometric. Suppose numbers are vectors in $\mathbb R^n$, addition is ordinary vector addition, and multiplication by a fixed nonzero number must act geometrically as a rotation together with a uniform scaling.
The author shows that this apparently simple requirement forces multiplication to be linear and distributive.
In the complex plane, for example, multiplication by $i$ is a quarter-turn, giving
$i^2=-1$
and recovering ordinary complex multiplication.
Why does three-dimensional multiplication fail?
The same geometric idea explains why a three-dimensional analogue cannot exist.
A rotation in $3$-dimensional space necessarily has an axis of fixed points. Its infinitesimal velocity field therefore vanishes along that axis.
However, multiplication by a nonzero number is supposed to be an invertible rotation-and-scaling transformation. It therefore cannot send a nonzero vector to zero.
More generally, if $u$ is a unit vector perpendicular to the multiplicative identity, the geometry forces
$u(ur)=-r$
From this and related orthogonality conditions, multiplication tables can be constructed progressively.
Two dimensions give the complex numbers, four dimensions force the quaternions, and extending the construction further eventually produces the eight-dimensional octonions.
Along the way, the article derives relations closely related to Clifford algebra identities:
$u(vr)+v(ur)=-2\langle u,v\rangle r$
Why only dimensions 1, 2, 4 and 8?
The construction cannot continue indefinitely.
Attempts to extend the same type of multiplication beyond the octonions eventually lead to contradictory multiplication rules.
Therefore, the only possible finite-dimensional real systems satisfying these geometric requirements occur in dimensions
$\boxed{1,;2,;4,;8}$
These correspond precisely to
$\boxed{\mathbb R,;\mathbb C,;\mathbb H,;\mathbb O}$
that is:
1 dimension: Real numbers $\mathbb R$
2 dimensions: Complex numbers $\mathbb C$
4 dimensions: Quaternions $\mathbb H$
8 dimensions: Octonions $\mathbb O$
This result is essentially Hurwitz's theorem, which states that the only finite-dimensional real normed division algebras are the real numbers, complex numbers, quaternions and octonions.
Their fundamental algebraic property is
$|xy|=|x|,|y|$
This means that multiplication by a nonzero element uniformly scales lengths while preserving the underlying geometric structure.
Key Takeaways
• The dimensions $1,2,4,8$ are not an accident. They arise from strong geometric restrictions on multiplication.
• There is no three-dimensional number system behaving like the complex numbers under multiplication.
• The natural progression is
$\mathbb R\rightarrow\mathbb C\rightarrow\mathbb H\rightarrow\mathbb O$
• The sequence ends with the octonions.
• The article gives a particularly geometric and intuitive route toward understanding Hurwitz's theorem, instead of presenting it only as an abstract algebraic classification.
Original article:
https://numbersystems.lejdar-lukas.workers.dev/]]> What Makes a Number System? Author: Lukáš Lejdar
Topic: Number systems, geometry, normed division algebras, Hurwitz’s theorem

The article asks why the familiar sequence of number systems seems to jump through dimensions
$\mathbb{R};(1),\qquad \mathbb{C};(2),\qquad \mathbb{H};(4),\qquad \mathbb{O};(8)$
rather than continuing naturally through dimensions $3,5,6,\ldots$.
Its starting point is geometric. Suppose numbers are vectors in $\mathbb R^n$, addition is ordinary vector addition, and multiplication by a fixed nonzero number must act geometrically as a rotation together with a uniform scaling.
The author shows that this apparently simple requirement forces multiplication to be linear and distributive.
In the complex plane, for example, multiplication by $i$ is a quarter-turn, giving
$i^2=-1$
and recovering ordinary complex multiplication.
Why does three-dimensional multiplication fail?
The same geometric idea explains why a three-dimensional analogue cannot exist.
A rotation in $3$-dimensional space necessarily has an axis of fixed points. Its infinitesimal velocity field therefore vanishes along that axis.
However, multiplication by a nonzero number is supposed to be an invertible rotation-and-scaling transformation. It therefore cannot send a nonzero vector to zero.
More generally, if $u$ is a unit vector perpendicular to the multiplicative identity, the geometry forces
$u(ur)=-r$
From this and related orthogonality conditions, multiplication tables can be constructed progressively.
Two dimensions give the complex numbers, four dimensions force the quaternions, and extending the construction further eventually produces the eight-dimensional octonions.
Along the way, the article derives relations closely related to Clifford algebra identities:
$u(vr)+v(ur)=-2\langle u,v\rangle r$
Why only dimensions 1, 2, 4 and 8?
The construction cannot continue indefinitely.
Attempts to extend the same type of multiplication beyond the octonions eventually lead to contradictory multiplication rules.
Therefore, the only possible finite-dimensional real systems satisfying these geometric requirements occur in dimensions
$\boxed{1,;2,;4,;8}$
These correspond precisely to
$\boxed{\mathbb R,;\mathbb C,;\mathbb H,;\mathbb O}$
that is:
1 dimension: Real numbers $\mathbb R$
2 dimensions: Complex numbers $\mathbb C$
4 dimensions: Quaternions $\mathbb H$
8 dimensions: Octonions $\mathbb O$
This result is essentially Hurwitz's theorem, which states that the only finite-dimensional real normed division algebras are the real numbers, complex numbers, quaternions and octonions.
Their fundamental algebraic property is
$|xy|=|x|,|y|$
This means that multiplication by a nonzero element uniformly scales lengths while preserving the underlying geometric structure.
Key Takeaways
• The dimensions $1,2,4,8$ are not an accident. They arise from strong geometric restrictions on multiplication.
• There is no three-dimensional number system behaving like the complex numbers under multiplication.
• The natural progression is
$\mathbb R\rightarrow\mathbb C\rightarrow\mathbb H\rightarrow\mathbb O$
• The sequence ends with the octonions.
• The article gives a particularly geometric and intuitive route toward understanding Hurwitz's theorem, instead of presenting it only as an abstract algebraic classification.
Original article:
https://numbersystems.lejdar-lukas.workers.dev/]]> <![CDATA[Differential Equations of Love]]> https://mklab.gr/showthread.php?tid=1734 Sun, 23 Aug 2026 23:29:09 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1734 Author: Isaac Elishakoff
Journal:Journal of Humanistic Mathematics, Vol. 9, No. 2
Publication: July 2019, pp. 226–246

Summary

Isaac Elishakoff uses the familiar story of Romeo and Juliet to demonstrate how very simple systems of ordinary differential equations can model interactions between two people. The idea follows the classical mathematical treatment introduced by Steven Strogatz: let $R(t)$ represent Romeo's feelings toward Juliet and $J(t)$ Juliet's feelings toward Romeo, with positive values representing love and negative values representing dislike. A general linear model can be written as
$\frac{dR}{dt}=aR+bJ$
$\frac{dJ}{dt}=cR+dJ$

where the coefficients describe how each person's feelings respond both to their own current emotions and to those of the other person. Depending on the signs and magnitudes of these coefficients, the relationship can converge toward mutual affection or indifference, grow without bound, or repeatedly alternate between love and hate. In one particularly instructive configuration, one person's affection increases when loved while the other's decreases, producing oscillatory behaviour—an endless mathematical cycle of attraction and rejection. 

Elishakoff's purpose is primarily pedagogical rather than psychological. The romantic metaphor makes concepts from differential equations—coupled systems, equilibrium, oscillations, eigenvalue behaviour, and stability—more intuitive and memorable. He argues that examples of this kind could be incorporated into engineering mathematics courses to increase students' interest in differential equations. The important point is not that equations can genuinely predict romantic relationships, but that the same mathematical structure can appear in situations that look completely unrelated. The article thus illustrates the broader modelling principle that variables may have very different interpretations while obeying mathematically identical dynamical laws.

The most striking part of the paper reverses the metaphor: instead of using mechanics to explain love, Elishakoff uses love and hate to interpret mechanical vibration. A simple undamped one-degree-of-freedom oscillator satisfies
$m\frac{d^2x}{dt^2}+kx=0$,
or
$\frac{d^2x}{dt^2}+\omega^2x=0$,
where $\omega^2=k/m$. Introducing velocity $v=\frac{dx}{dt}$ converts this into two coupled first-order equations,
$\frac{dx}{dt}=v$
$\frac{dv}{dt}=-\omega^2x$.
The variables $x$ and $v$ can therefore be viewed metaphorically as a pair whose responses to one another generate a perpetual oscillation. For a stable mechanical system the solutions are trigonometric, such as $\sin(\omega t)$ and $\cos(\omega t)$. When the effective stiffness changes sign, however, the equation becomes
$\frac{d^2x}{dt^2}-\lambda^2x=0$,
whose solutions involve exponential or hyperbolic functions such as $\cosh(\lambda t)$ and $\sinh(\lambda t)$. The bounded oscillation is replaced by rapidly growing motion—mechanical dynamic instability. Elishakoff memorably describes this as a transition from “trigonometric love” to “hyperbolic love.” 

Key takeaways
  • Love serves as a teaching metaphor for dynamical systems: coupled differential equations can represent how two quantities continuously influence one another.
  • Different parameter choices produce equilibrium, growth, decay, or periodic love–hate cycles, illustrating stability and qualitative behaviour of differential equations.
  • The mathematics is intentionally playful; the paper's central goal is to make ordinary differential equations more engaging for engineering students, not to claim that human relationships are literally predictable. 
  • The same mathematical structure describes a mechanical oscillator: stable motion corresponds to trigonometric oscillation, while instability produces hyperbolic/exponential growth, showing how one mathematical model can connect humanistic metaphor with engineering mechanics. 

ARTICLE [PDF]]]> Author: Isaac Elishakoff
Journal:Journal of Humanistic Mathematics, Vol. 9, No. 2
Publication: July 2019, pp. 226–246

Summary

Isaac Elishakoff uses the familiar story of Romeo and Juliet to demonstrate how very simple systems of ordinary differential equations can model interactions between two people. The idea follows the classical mathematical treatment introduced by Steven Strogatz: let $R(t)$ represent Romeo's feelings toward Juliet and $J(t)$ Juliet's feelings toward Romeo, with positive values representing love and negative values representing dislike. A general linear model can be written as
$\frac{dR}{dt}=aR+bJ$
$\frac{dJ}{dt}=cR+dJ$

where the coefficients describe how each person's feelings respond both to their own current emotions and to those of the other person. Depending on the signs and magnitudes of these coefficients, the relationship can converge toward mutual affection or indifference, grow without bound, or repeatedly alternate between love and hate. In one particularly instructive configuration, one person's affection increases when loved while the other's decreases, producing oscillatory behaviour—an endless mathematical cycle of attraction and rejection. 

Elishakoff's purpose is primarily pedagogical rather than psychological. The romantic metaphor makes concepts from differential equations—coupled systems, equilibrium, oscillations, eigenvalue behaviour, and stability—more intuitive and memorable. He argues that examples of this kind could be incorporated into engineering mathematics courses to increase students' interest in differential equations. The important point is not that equations can genuinely predict romantic relationships, but that the same mathematical structure can appear in situations that look completely unrelated. The article thus illustrates the broader modelling principle that variables may have very different interpretations while obeying mathematically identical dynamical laws.

The most striking part of the paper reverses the metaphor: instead of using mechanics to explain love, Elishakoff uses love and hate to interpret mechanical vibration. A simple undamped one-degree-of-freedom oscillator satisfies
$m\frac{d^2x}{dt^2}+kx=0$,
or
$\frac{d^2x}{dt^2}+\omega^2x=0$,
where $\omega^2=k/m$. Introducing velocity $v=\frac{dx}{dt}$ converts this into two coupled first-order equations,
$\frac{dx}{dt}=v$
$\frac{dv}{dt}=-\omega^2x$.
The variables $x$ and $v$ can therefore be viewed metaphorically as a pair whose responses to one another generate a perpetual oscillation. For a stable mechanical system the solutions are trigonometric, such as $\sin(\omega t)$ and $\cos(\omega t)$. When the effective stiffness changes sign, however, the equation becomes
$\frac{d^2x}{dt^2}-\lambda^2x=0$,
whose solutions involve exponential or hyperbolic functions such as $\cosh(\lambda t)$ and $\sinh(\lambda t)$. The bounded oscillation is replaced by rapidly growing motion—mechanical dynamic instability. Elishakoff memorably describes this as a transition from “trigonometric love” to “hyperbolic love.” 

Key takeaways
  • Love serves as a teaching metaphor for dynamical systems: coupled differential equations can represent how two quantities continuously influence one another.
  • Different parameter choices produce equilibrium, growth, decay, or periodic love–hate cycles, illustrating stability and qualitative behaviour of differential equations.
  • The mathematics is intentionally playful; the paper's central goal is to make ordinary differential equations more engaging for engineering students, not to claim that human relationships are literally predictable. 
  • The same mathematical structure describes a mechanical oscillator: stable motion corresponds to trigonometric oscillation, while instability produces hyperbolic/exponential growth, showing how one mathematical model can connect humanistic metaphor with engineering mechanics. 

ARTICLE [PDF]]]> <![CDATA[Grothendieck’s Constant]]> https://mklab.gr/showthread.php?tid=1588 Sat, 15 Aug 2026 10:45:45 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1588 Grothendieck’s Constant

Summary

The MathWorld article introduces Grothendieck’s constant, a remarkable universal constant arising from Alexander Grothendieck’s 1953 work in functional analysis. Roughly speaking, Grothendieck discovered that when a certain bilinear expression involving ordinary bounded real numbers is replaced by one involving inner products of vectors in a Hilbert space, the resulting expression can grow—but only by a fixed multiplicative factor, independent of the dimension. For an $n\times n$ real matrix this factor is denoted $k_R(n)$, and the limiting quantity $k_R=\lim_{n\to\infty}k_R(n)$ is usually called the real Grothendieck constant, also written $K_G$. The remarkable point is that such a dimension-independent bound exists at all.
Despite decades of research, the exact value of $K_G$ remains unknown. MathWorld gives the classical bounds $1.67696\ldots\leq K_G\leq1.7822139781\ldots$. Jean-Louis Krivine conjectured that the upper bound was exact, proposing $K_G=\frac{\pi}{2\ln(1+\sqrt2)}\approx1.7822139$, but this long-standing conjecture was disproved in 2011 by Mark Braverman, Konstantin Makarychev, Yury Makarychev and Assaf Naor, who showed that $K_G$ is strictly smaller than Krivine’s value. For finite dimensions more can be said—for example, $k_R(2)=\sqrt2$, while only ranges are known for several higher dimensions. 
The article also describes the complex Grothendieck constant, obtained when the matrix entries and scalar variables are complex. Its limiting value $k_C$ is likewise not known exactly; MathWorld reports $1.33807\leq k_C\leq1.40491$ and discusses Haagerup’s proposed value of approximately $1.4045759$. Thus Grothendieck’s constant is an excellent example of a mathematical object whose existence and importance are well established while its precise numerical value remains elusive. What began in abstract Banach-space theory has also become important in areas such as optimization, approximation algorithms, graph problems, communication complexity and quantum-information theory. 
Key Takeaways
  • Universal bound: Grothendieck’s inequality guarantees a constant controlling the passage from scalar bilinear expressions to vector inner products, regardless of dimension.
  • Exact value unknown: The real constant satisfies approximately $1.67696\leq K_G<1.78221$.
  • Famous conjecture overturned: Krivine’s proposed exact value was disproved in 2011.
  • Broad significance: A constant originating in functional analysis now connects pure mathematics with optimization, theoretical computer science and quantum-information problems.

ARTICLE]]> Grothendieck’s Constant

Summary

The MathWorld article introduces Grothendieck’s constant, a remarkable universal constant arising from Alexander Grothendieck’s 1953 work in functional analysis. Roughly speaking, Grothendieck discovered that when a certain bilinear expression involving ordinary bounded real numbers is replaced by one involving inner products of vectors in a Hilbert space, the resulting expression can grow—but only by a fixed multiplicative factor, independent of the dimension. For an $n\times n$ real matrix this factor is denoted $k_R(n)$, and the limiting quantity $k_R=\lim_{n\to\infty}k_R(n)$ is usually called the real Grothendieck constant, also written $K_G$. The remarkable point is that such a dimension-independent bound exists at all.
Despite decades of research, the exact value of $K_G$ remains unknown. MathWorld gives the classical bounds $1.67696\ldots\leq K_G\leq1.7822139781\ldots$. Jean-Louis Krivine conjectured that the upper bound was exact, proposing $K_G=\frac{\pi}{2\ln(1+\sqrt2)}\approx1.7822139$, but this long-standing conjecture was disproved in 2011 by Mark Braverman, Konstantin Makarychev, Yury Makarychev and Assaf Naor, who showed that $K_G$ is strictly smaller than Krivine’s value. For finite dimensions more can be said—for example, $k_R(2)=\sqrt2$, while only ranges are known for several higher dimensions. 
The article also describes the complex Grothendieck constant, obtained when the matrix entries and scalar variables are complex. Its limiting value $k_C$ is likewise not known exactly; MathWorld reports $1.33807\leq k_C\leq1.40491$ and discusses Haagerup’s proposed value of approximately $1.4045759$. Thus Grothendieck’s constant is an excellent example of a mathematical object whose existence and importance are well established while its precise numerical value remains elusive. What began in abstract Banach-space theory has also become important in areas such as optimization, approximation algorithms, graph problems, communication complexity and quantum-information theory. 
Key Takeaways
  • Universal bound: Grothendieck’s inequality guarantees a constant controlling the passage from scalar bilinear expressions to vector inner products, regardless of dimension.
  • Exact value unknown: The real constant satisfies approximately $1.67696\leq K_G<1.78221$.
  • Famous conjecture overturned: Krivine’s proposed exact value was disproved in 2011.
  • Broad significance: A constant originating in functional analysis now connects pure mathematics with optimization, theoretical computer science and quantum-information problems.

ARTICLE]]> <![CDATA[Cantor's intersection theorem]]> https://mklab.gr/showthread.php?tid=1587 Thu, 13 Aug 2026 21:15:10 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1587 Cantor's intersection theorem

Summary

Cantor’s Intersection Theorem is a fundamental result connecting nested sets, compactness, and completeness. In its topological form, it says that if we have a decreasing sequence of non-empty compact closed sets
$$
C_0\supseteq C_1\supseteq C_2\supseteq\cdots,
$$
then they must have at least one point in common:
$$
\bigcap_{k=0}^{\infty}C_k\neq\varnothing.
$$
For subsets of $\mathbb R$, compactness can be replaced by the more familiar conditions closed and bounded. Thus an infinite sequence of nested, non-empty, closed and bounded subsets cannot gradually “lose” every point. A simple example is $C_k=[0,1/k]$: although the intervals become arbitrarily small, their intersection remains ${0}$. The assumptions matter: $(0,1/k)$ has empty intersection because the intervals are not closed, while $[k,\infty)$ has empty intersection because the sets are unbounded.
An especially important version occurs in a complete metric space. If the nested sets $C_k$ are non-empty and closed and their diameters satisfy
$$
\lim_{k\to\infty}\operatorname{diam}(C_k)=0,
$$
then their intersection contains exactly one point:
$$
\bigcap_{k=1}^{\infty}C_k={x}.
$$
The idea is to choose $x_k\in C_k$; because the sets become arbitrarily small, $(x_k)$ is a Cauchy sequence. Completeness guarantees that it converges, while closedness ensures that its limit belongs to every $C_k$. Remarkably, the converse also holds: this nested-set property characterizes completeness of metric spaces. The theorem also helps explain why the Cantor set is non-empty, since it is constructed as the intersection of a decreasing sequence of non-empty closed bounded sets.

Key takeaways
  • Nested compact sets cannot disappear: $\bigcap C_k\neq\varnothing$.
  • In $\mathbb R$, closed + bounded provides the required compactness.
  • If additionally $\operatorname{diam}(C_k)\to0$ in a complete metric space, the intersection is exactly one point.
  • The theorem reveals a deep connection between compactness, completeness, convergence, and infinite limiting processes.



ARTICLE / ARCHIVE]]> Cantor's intersection theorem

Summary

Cantor’s Intersection Theorem is a fundamental result connecting nested sets, compactness, and completeness. In its topological form, it says that if we have a decreasing sequence of non-empty compact closed sets
$$
C_0\supseteq C_1\supseteq C_2\supseteq\cdots,
$$
then they must have at least one point in common:
$$
\bigcap_{k=0}^{\infty}C_k\neq\varnothing.
$$
For subsets of $\mathbb R$, compactness can be replaced by the more familiar conditions closed and bounded. Thus an infinite sequence of nested, non-empty, closed and bounded subsets cannot gradually “lose” every point. A simple example is $C_k=[0,1/k]$: although the intervals become arbitrarily small, their intersection remains ${0}$. The assumptions matter: $(0,1/k)$ has empty intersection because the intervals are not closed, while $[k,\infty)$ has empty intersection because the sets are unbounded.
An especially important version occurs in a complete metric space. If the nested sets $C_k$ are non-empty and closed and their diameters satisfy
$$
\lim_{k\to\infty}\operatorname{diam}(C_k)=0,
$$
then their intersection contains exactly one point:
$$
\bigcap_{k=1}^{\infty}C_k={x}.
$$
The idea is to choose $x_k\in C_k$; because the sets become arbitrarily small, $(x_k)$ is a Cauchy sequence. Completeness guarantees that it converges, while closedness ensures that its limit belongs to every $C_k$. Remarkably, the converse also holds: this nested-set property characterizes completeness of metric spaces. The theorem also helps explain why the Cantor set is non-empty, since it is constructed as the intersection of a decreasing sequence of non-empty closed bounded sets.

Key takeaways
  • Nested compact sets cannot disappear: $\bigcap C_k\neq\varnothing$.
  • In $\mathbb R$, closed + bounded provides the required compactness.
  • If additionally $\operatorname{diam}(C_k)\to0$ in a complete metric space, the intersection is exactly one point.
  • The theorem reveals a deep connection between compactness, completeness, convergence, and infinite limiting processes.



ARTICLE / ARCHIVE]]> <![CDATA[Bessel function]]> https://mklab.gr/showthread.php?tid=1548 Mon, 10 Aug 2026 14:49:18 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1548
Summary

Bessel functions are a family of special functions that arise as solutions to Bessel’s differential equation, $x^2y''+xy'+(x^2-\alpha^2)y=0$, and are especially important for problems with circular, cylindrical, or spherical symmetry. 
They were systematically studied by the German mathematician and astronomer Friedrich Bessel and are widely used in physics and engineering, including wave propagation, heat conduction, electromagnetic waves, vibrations of circular membranes, acoustics, quantum mechanics, fluid dynamics, and signal processing. 

The main types include Bessel functions of the first kind $J_\alpha(x)$, second kind $Y_\alpha(x)$, Hankel functions, modified Bessel functions, and spherical Bessel functions. The functions of the first kind generally exhibit oscillatory behavior similar to sine and cosine, with their amplitude decreasing approximately as $x^{-1/2}$ for large $x$, while their mathematical properties include recurrence relations, integral representations, series expansions, and important patterns in their zeros. 

ARTICLE]]>
Summary

Bessel functions are a family of special functions that arise as solutions to Bessel’s differential equation, $x^2y''+xy'+(x^2-\alpha^2)y=0$, and are especially important for problems with circular, cylindrical, or spherical symmetry. 
They were systematically studied by the German mathematician and astronomer Friedrich Bessel and are widely used in physics and engineering, including wave propagation, heat conduction, electromagnetic waves, vibrations of circular membranes, acoustics, quantum mechanics, fluid dynamics, and signal processing. 

The main types include Bessel functions of the first kind $J_\alpha(x)$, second kind $Y_\alpha(x)$, Hankel functions, modified Bessel functions, and spherical Bessel functions. The functions of the first kind generally exhibit oscillatory behavior similar to sine and cosine, with their amplitude decreasing approximately as $x^{-1/2}$ for large $x$, while their mathematical properties include recurrence relations, integral representations, series expansions, and important patterns in their zeros. 

ARTICLE]]> <![CDATA[A Primer on Measure Theory]]> https://mklab.gr/showthread.php?tid=1539 Sun, 09 Aug 2026 12:54:19 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1539
Summary

The article provides an accessible introduction to measure theory through the revolutionary work of Henri Lebesgue, explaining how Lebesgue’s 1902 PhD thesis overcame limitations of the Riemann integral, particularly the difficulty of exchanging limits and integrals and handling pathological functions. It introduces σ-algebras and measures as a rigorous way to assign “size” to sets, develops the Lebesgue measure and Lebesgue integral using measurable and simple functions, and shows how this framework extends integration beyond ordinary intervals and functions. 

The article also highlights important applications: with counting measure, integration becomes infinite summation; with Dirac measure, it provides a rigorous interpretation of the Dirac delta; and the Dominated Convergence Theorem gives powerful conditions for interchanging limits and integrals. Finally, it explains that probability theory is naturally formulated in terms of measures, demonstrating why measure theory became foundational to functional analysis, probability, ergodic theory, and modern mathematics. 

ARTICLE]]>
Summary

The article provides an accessible introduction to measure theory through the revolutionary work of Henri Lebesgue, explaining how Lebesgue’s 1902 PhD thesis overcame limitations of the Riemann integral, particularly the difficulty of exchanging limits and integrals and handling pathological functions. It introduces σ-algebras and measures as a rigorous way to assign “size” to sets, develops the Lebesgue measure and Lebesgue integral using measurable and simple functions, and shows how this framework extends integration beyond ordinary intervals and functions. 

The article also highlights important applications: with counting measure, integration becomes infinite summation; with Dirac measure, it provides a rigorous interpretation of the Dirac delta; and the Dominated Convergence Theorem gives powerful conditions for interchanging limits and integrals. Finally, it explains that probability theory is naturally formulated in terms of measures, demonstrating why measure theory became foundational to functional analysis, probability, ergodic theory, and modern mathematics. 

ARTICLE]]>