How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced — the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted — a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated — a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The Dirichlet function , and Thomae's function with at a rational in lowest terms with and at every irrational
Definition
Throughout, denotes the chain of canonical embeddings (The naturals embed in the integers, The integers embed in the rationals, The rationals embed densely in the reals), and each set is identified with its image in , as elsewhere in this library; for a natural the real is the canonical natural (The canonical natural of a field), and for (Canonical naturals are positive and strictly increasing). A real is rational when it lies in and irrational otherwise; both sets are dense in (Both and are dense in , and every nonempty open subset of is uncountable).
The Dirichlet function
This is the indicator of the rationals. It is a function because every real either lies in or does not, and the two clauses are exclusive.
The least denominator of a rational
Let and put
is nonempty. Every rational is with and a positive integer (The integers embed in the rationals), and a positive integer is for a unique natural (The naturals embed in the integers); then , so .
By the well-ordering principle (The well-ordering principle) the nonempty subset has a least element. Write
the least denominator of , and , so that
Nothing is selected here: is the least element of a set determined by , so it is a function of alone.
The least denominator is the denominator in lowest terms. The integers and are coprime (Coprime integers: ). Indeed put , which satisfies because makes the pair different from ( is symmetric and unchanged by signs: ; moreover , , , and unless , Common divisor, and the greatest common divisor , with the convention ). Then divides , so is a natural number , and because carries products of naturals to products (Canonical naturals are positive and strictly increasing); hence
so and therefore , which forces . Conversely, a lowest-terms denominator is the least one, so the description is unambiguous. Suppose with a natural, and . Then , so ; and from we get in , so , and gives (If and then ; and if , and then , claim 1), hence . So : writing "in lowest terms with " and taking describe the same integer, and If is nonzero then and are coprime is what produces such a representation from an arbitrary one.
Thomae's function
It is also called the popcorn function or the ruler function. The value is well defined because is, and is invertible.
Boundary values, stated rather than left to the reader.
- . Indeed , so and ; the representation is .
- for every integer , by the same computation with .
- for every rational , since ; and exactly at the irrationals.
On the range. The values of are and the reciprocals of the canonical naturals ; every such value is attained, being the value at the rational itself, whose least denominator is because with would give a positive integer smaller than .
Depends on
- If $\gcd(a,b) = 1$ and $a \mid bc$ then $a \mid c$; and if $a \mid c$, $b \mid c$ and $\gcd(a,b) = 1$ then $ab \mid c$
- The rationals embed densely in the reals
- The integers embed in the rationals
- The naturals embed in the integers
- Coprime integers: $\gcd(a,b) = 1$
- If $d = \gcd(a,b)$ is nonzero then $a/d$ and $b/d$ are coprime
- $\gcd$ is symmetric and unchanged by signs: $\gcd(a,b) = \gcd(b,a) = \gcd(|a|,|b|)$; moreover $\gcd(a,0) = |a|$, $\gcd(a,1) = 1$, $\gcd(a,a) = |a|$, and $\gcd(a,b) \ge 1$ unless $a = b = 0$
- Common divisor, and the greatest common divisor $\gcd(a,b)$, with the convention $\gcd(0,0) := 0$
- The well-ordering principle
- Complete ordered field (least-upper-bound property)
- The canonical natural $\iota(n) = n \cdot 1_F$ of a field
- Canonical naturals are positive and strictly increasing
- Both $\mathbb{Q}$ and $\mathbb{R} \setminus \mathbb{Q}$ are dense in $\mathbb{R}$, and every nonempty open subset of $\mathbb{R}$ is uncountable
Used by
- A function that is not Riemann integrable although | f| is Counterexample
- For the Dirichlet function every uniform partition with rational tags gives Riemann sum 1, so the sums converge along that sequence of tagged partitions although the function is not integrable: the mesh condition of the Riemann definition quantifies over all tagged partitions and cannot be weakened to one sequence Counterexample
- Integrable φ and integrable f with φ∘ f not integrable: the order of the hypotheses in the composition theorem cannot be reversed Counterexample
- One existing iterated integral does not imply multiple Riemann integrability Counterexample
- The Dirichlet function on [0,1] has lower Darboux integral 0 and upper Darboux integral 1, so it is bounded and not Riemann integrable Counterexample
- Thomae's function is nonnegative, Riemann integrable on [0,1] with integral 0, and nonzero at every rational, so a vanishing integral does not force a nonnegative integrand to vanish Counterexample
- A Riemann-integrable Thomae-type function whose x-sections are nonintegrable at every rational height Example
- An integrable function on the unit square with one Dirichlet section and only one defined order of ordinary iteration Example
- The Dirichlet function is the pointwise limit of a sequence of Baire class one functions and is itself not Baire class one, so the Baire hierarchy on [0,1] is already strict at the first level Example
- The function equal to q at a rational p/q in lowest terms and to 0 at every irrational is finite at every point and unbounded on every nondegenerate interval Example
- Thomae's function computed: t(1/2) = 1/2, t(2/3) = 1/3, t(m) = 1 at every integer m, t(x) = 0 at every irrational, and ωₜ(c) = t(c) at every real c Example
- Thomae's function is Riemann integrable on [0,1] with integral 0: it is continuous at every irrational, so its discontinuity set is countable, and every lower Darboux sum is 0 Example
- FALSE: a nonnegative Riemann integrable function on [a,b] with ∫ₐᵇ f = 0 is identically zero False statement
- FALSE: a pointwise limit of a sequence of Riemann integrable functions on [a,b] is Riemann integrable False statement
- FALSE: every bounded function on [a,b] is Riemann integrable False statement
- The Dirichlet function is continuous at no point of ℝ, and Thomae's function is continuous at every irrational and at no rational, so its set of continuity points is exactly the set of irrationals and its oscillation at c equals t(c) Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 123 results over 32 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Thomae's function (Wikipedia) (standard reference, not scraped)
- Dirichlet function (Wikipedia) (standard reference, not scraped)