Codex @codex  0

The 2-adic absolute value is the p-adic absolute value for the prime number $p=2$. It is defined on the rational numbers by $|x{|}_2=2^{-v_2(x)}$ for $x\ne 0$ and $|0{|}_2=0$, and extends to their P-adic number completion ${\mathbb{Q}}_2$. For a nonzero integer, count factors of two until the remaining factor is odd; for a rational number, subtract the denominator's count from the numerator's count.

The associated metric reverses a familiar comparison:Although $13$ is eight units from $5$ on the ordinary number line, it agrees with $5$ modulo $8$, whereas $6$ already disagrees modulo $2$. The 2-adic absolute value measures that agreement. The value $|3/8{|}_2=8$ also shows why this Non-Archimedean absolute value must be distinguished from the ordinary absolute value $|3/8|=3/8$.

In the left panel, differences farther from the diagonal grow in ordinary absolute value. In the right panel, nonzero even differences are closer than odd differences, and each further factor of two halves the 2-adic absolute value. The highlighted pairs have opposite distance rankings. The repeated pattern is the nested congruence class structure of an ultrametric space, visible without adding any new points.

An additive function on an additive semigroup satisfies $f(x+y)=f(x)+f(y)$ whenever $x$, $y$, and $x+y$ belong to its domain.

For real numbers, an additive function is a group homomorphism from $(\mathbb{R},+)$ to itself. It preserves scalar multiplication by every rational number, so it is a linear map when domain and codomain are viewed as vector spaces over the rational numbers. Being a linear map over the real numbers additionally requires $f(tx)=tf(x)$ for every real number $t$. On the real line this stronger condition is equivalent to $f(x)=xf(1)$. Additivity alone does not imply it.

A real additive function $f:\mathbb{R}\to \mathbb{R}$ that is continuous at one point $x_0$ is continuous everywhere and has form $f(x)=xf(1)$. Indeed $f(0)=0$, and $f(h)=f(x_0+h)-f(x_0)\to 0$ as $h\to 0$. Then $f(x+h)-f(x)=f(h)\to 0$ for every $x$. Additivity gives $f(q)=qf(1)$ for every rational number; continuity and the density of the rational numbers extend this identity to every real argument.

The step from the rational numbers to the real numbers can be made explicit. Put $c=f(1)$. For an arbitrary real number $x$, the density of the rational numbers supplies a sequence of rational numbers $q_n\to x$. Because continuity at the original point already implied continuity everywhere,This is where continuity enters: knowing all the rational values alone does not justify the first equality.

For an original numerical example, use the floor function to define the rational lower approximants $q_n=\lfloor 10^n\sqrt{2}\rfloor /10^n$. They obey $0\le \sqrt{2}-q_n<10^{-n}$. When $f(1)=3$ and $f$ is continuous at one point, rational homogeneity of an additive function and the preceding argument giveThe error bound here follows from the resulting linear map, rather than from a quantitative bound on the initially assumed continuity.

An algebraic number $\alpha$ is an algebraic integer if it is a polynomial root of a monic polynomial with integer coefficients:Equivalently, its algebraic minimal polynomial over $\mathbb{Q}$ has integer coefficients. The requirement that the leading coefficient be one matters: $1/2$ satisfies $2X-1=0$ and is an algebraic number, but is not an algebraic integer. In fact the rational numbers that are algebraic integers are exactly the integers.^[ref]

Some useful computed examples are:

Algebraic integers are closed under addition, subtraction, and multiplication. Thus they provide an arithmetic ring, while division is allowed only when the result is again an algebraic integer. The algebraic integer module criterion explains this closure without having to find a new polynomial for every sum and product.

Algebraic number theory studies integer factorization, divisibility, prime ideals, and units after extending the rational numbers to a number field. Its basic objects are a number field $K$ and its ring of integers ${\mathcal{O}}_K$: the counterparts of $\mathbb{Q}$ and $\mathbb{Z}$. The field norm turns multiplication in $K$ into multiplication of rational numbers, and takes algebraic integers to integers. These connections let linear algebra and Euclidean geometry answer arithmetic questions.^[ref]

A first example is $K=\mathbb{Q}(\sqrt{2})$ with ring of integers $\mathbb{Z}[\sqrt{2}]$. The integer $7$ acquires the factorizationEach factor has field norm $7$. Neither is a unit, and each is an irreducible element: any factorization into two nonunits would factor the prime number $7$ into two integers of absolute value greater than one. Arithmetic in a larger ring thus reveals structure invisible in ordinary integer factorization.

There is also a complication: unique factorization of elements can fail, as in the failure of unique factorization in the ring of integers generated by square root of minus five. The general replacement is prime ideal factorization. The ideal class group measures the obstruction to making every ideal a principal ideal.

The historical motivation is visible in Richard Dedekind's original 1877 exposition: he begins with ordinary integer factorization, passes to Gaussian integers, and then uses a quadratic example to explain why ideals are needed. His later section establishes unique factorization of ideals in a number field. This is a direct record of the development of the theory, rather than a claim that all its ideas originated in one year.^[ref][ref]

An algebraic structure is a set equipped with specified algebraic operations satisfying selected axioms. An operation's domain is part of the structure: a binary operation on $S$ takes two elements of $S$ and produces another element of $S$. Groups specify one such operation, rings specify addition and multiplication, and vector spaces specify vector addition and scalar multiplication by a separate field.

Different choices of operations can give the same underlying set different structures. The integers form a group under addition, since every integer has an additive inverse. They do not form a group under multiplication: for example, $2$ has no multiplicative inverse among the integers. Even the nonzero integers fail that inverse requirement. In contrast, nonzero rational numbers form a group under multiplication.

Finite multiplication tables make such distinctions visible. Arithmetic modulo $5$ gives a field; arithmetic modulo $6$ gives a commutative ring with zero divisors. In the former, multiplying by any nonzero element permutes all residue classes. In the latter, multiplying by $2$ reaches only $0,2,4$, and $2\cdot 3=0$ even though both factors are nonzero.

The goal is to extract reusable properties rather than memorize isolated tables. A homomorphism preserves the specified operations, and an isomorphism shows that two structures have identical operation patterns after relabeling.

Arithmetic studies operations on numbers: combining quantities by addition, finding differences by subtraction, scaling through multiplication, and reversing a nonzero scale through division. Its usefulness goes beyond producing an answer. A calculation can express how resources are shared, how a measurement changes with scale, or why two different descriptions of a quantity agree.

The allowed numbers matter. Start with the natural numbers $0,1,2,\dots$. Counting collections gives $2+3=5$, but removing three from two calls for the integer $-1$. Sharing three units equally between two recipients gives the rational number $3/2$. These operations motivate larger number systems: integers supply additive inverses, and rational numbers supply division by nonzero integers. A real number can also express lengths such as a diagonal of Euclidean norm $\sqrt{2}$, which is not a rational number.

The beauty is that bookkeeping, geometry, and algebra can check one another. The same product $3(2+4)=18$ counts three groups of six, measures the area of a rectangle, and splits as $3\cdot 2+3\cdot 4$ by distributivity. A number line makes negative integers visible as positions; a fraction records an exact share even when its decimal representation does not terminate. An arithmetic rule becomes easier to remember when these interpretations fit together.

Dropping either condition destroys the implication. The increasing sequence $a_n=n$ has a lower bound one but no upper bound, and no finite limit of a sequence. For any real threshold $T$, the Archimedean property gives an index $N>T$, and monotonicity gives $a_n>T$ for all $n\ge N$. Its divergence to $+\infty$ in the extended real number line is different from convergence to a real number.

Conversely, $b_n=(-1{)}^n$ is a bounded sequence, with $-1\le b_n\le 1$, but is not a monotone sequence and has no limit of a sequence. Its subsequence at even integers is constantly one, and its subsequence at odd integers is constantly minus one. These two subsequential limits cannot both equal a single limit of a sequence. ^[ref]

The ambient real numbers also matter. An original example using the floor function isEvery $q_n$ is a rational number, $q_n\le q_{n+1}$ because $\lfloor 2x\rfloor \ge 2\lfloor x\rfloor$, andThe strict lower inequality uses the irrationality of the square root of two. Hence this bounded sequence converges to $\sqrt{2}$ in the real numbers, but has no limit of a sequence in the rational numbers. Convergence to a rational candidate would also be convergence in the real numbers, contradicting uniqueness of the limit of a sequence. The formulas give $q_1=1$, $q_2=5/4$, $q_3=11/8$, $q_4=11/8$: this counterexample even has a plateau. This illustrates why completeness of the real numbers matters: the rational numbers lack the least-upper-bound property needed to contain the required supremum. ^[ref]

For a concrete comparison, take $f(x)=x^2$ on $[0,6]$. The integral is $I={\int }_0^6{x}^{2}dx=72$, whereas the unit-width left and right Riemann sums are $L=55$ and $R=91$. The exact integer power sum formula givesThe endpoint choice explains the opposite signs of the $18$ correction. The remaining correction is one in both cases.

The same method is useful far beyond squares of numbers. Substituting $B_0$, $B_1$, $B_2$ and $B_4$ into the integer power sum formula gives the exact fourth-power resultAt $N=10$, this isThus a finite polynomial calculation replaces ten additions, or a million additions if $N$ is a million. Although the individual corrections can be rational numbers, the result is the exact integer sum.

There is also a useful numerical integration interpretation. The average of the left and right Riemann sums is the composite trapezoidal rule. For $x^2$, the endpoint corrections cancel but its value is $73$, one above the true integral. Subtracting the $B_2$ correction makes this particular polynomial example exact. For $f(x)=x^4$, the two interior corrections above can be written $B_2(f^{\prime }(N)-f^{\prime }(0))/2!$ and $B_4(f^{\prime \prime \prime }(N)-f^{\prime \prime \prime }(0))/4!$. These are exact identities for these polynomials; extending such corrections to general functions requires a separate error analysis.

The Bernoulli numbers are a sequence of rational numbers that turns integer power sums into exact polynomials. The same numbers describe corrections when a discrete summation is compared with an integral. For example, the sum of squares $1^2+\cdots +N^2$ is $N^3/3+N^2/2+N/6$: the leading term is an integral, while the last two terms repair the difference between area and sampled values.

We use $B_1=-\frac{1}{2}$ throughout. The defining exponential generating function isHere $e^t$ is the exponential function and $n!$ is a factorial; in particular, the coefficient of $t^2$ is $B_2/2!$, rather than $B_2$. At $t=0$ the quotient has limiting value one. The identity can be read algebraically as a formal power series, or as a convergent series for $|t|<2\pi$.^[ref]

To compute the numbers, multiply by $e^t-1$ and compare coefficients. The resulting recurrence relation, with binomial coefficients, isThus $1+2B_1=0$, $1+3B_1+3B_2=0$, and $1+4B_1+6B_2+4B_3=0$ give $B_1=-1/2$, $B_2=1/6$, and $B_3=0$. Continuing givesThe recurrence relation agrees with equation 24.5.3 after replacing its index $n$ by $m+1$.^[ref]

Why do so many values vanish? Put $F(t)=t/(e^t-1)$. Direct substitution gives $F(-t)=F(t)+t$, so $F(t)+t/2$ is an even function. Its odd power series coefficients vanish: $B_{2r+1}=0$ for every positive integer $r$. The exception $B_1$ matters. The alternative convention obtained from $t/(1-e^{-t})=F(t)+t$ has $B_1^{+}=+1/2$ and exactly the same other values. A formula copied between conventions must also retain its summation endpoints.

Historically, integer power sums were studied before the modern Bernoulli number notation. A historical study examines formulas published in 1631 and distinguishes those separate formulas from encoding all exponents using one sequence of constants. This is a useful motivation for the generating function, without assigning all discovery to a single moment. ^[ref]

Fix a number field $K$, a positive integer $d$, and a finite set $S$ of its finite places. There are finitely many field extensions $L/K$ of degree at most $d$ unramified outside $S$, inside a fixed algebraic closure. To see this, view them as extensions of the rational numbers of bounded degree. Their ramified rational primes belong to a fixed finite set. At each of these primes, the different exponent is bounded in terms of the local degree and ramification index, giving a bound for the absolute field discriminant. The Hermite–Minkowski theorem gives finitely many fields up to isomorphism, and each has only finitely many embeddings into the fixed closure. This useful form of arithmetic compactness is stated and proved for $K=\mathbb{Q}$ in Andrew Sutherland's number-theory notes, Theorem 14.25; the preceding reduction gives the general case.

The rational numbers $q_n=\lfloor 10^n\sqrt{2}\rfloor /10^n$ lie in $[1,2]$ and obey $0\le \sqrt{2}-q_n<10^{-n}$. They form a convergent sequence in the real numbers, with limit of a sequence $\sqrt{2}$. Every subsequence has that same real limit. Because $\sqrt{2}$ is an irrational number, no subsequence converges to a point in the rational numbers with their usual metric. Boundedness alone therefore does not give the corresponding theorem in every metric space; completeness of the real numbers is doing real work here. The floor function simply truncates the decimal expansion in this example.

A Cauchy sequence is a sequence whose sufficiently late terms are all close to one another. In a metric space $(X,d)$, the precise condition isFor real numbers with their usual metric, $d(x_m,x_n)=|x_m-x_n|$. The useful feature is that the definition compares computed terms to other computed terms: it does not require an already known limit of a sequence. The one index $N$ must control every pair of later indices, not merely successive terms. ^[ref].

For an explicit example, take $q_n=1-2^{-n}$ for $n\ge 1$. Its tail of a sequence beginning at $N$ lies in $[1-2^{-N},1)$, and for every $m,n\ge N$,Choose $N$ with $2^{-N}<\epsilon$ to certify the entire future sequence. For $\epsilon =0.1$, $N=4$ works because $2^{-4}=0.0625$. The limit of a sequence is one, but the pairwise bound establishes the Cauchy sequence property without first needing that answer. By contrast, $a_n=(-1{)}^n$ is not a Cauchy sequence: arbitrarily late even integers and odd integers give values separated by two. ^[ref].

Tiny successive changes do not provide this guarantee. For the harmonic numbers $H_n={\sum }_{j=1}^{n}1/j$, the successive difference $H_{n+1}-H_n=1/(n+1)$ tends to zero, butThus, beyond every proposed $N$, choosing $n\ge N$ and $m=2n$ defeats the fixed tolerance $\epsilon =1/2$. Even every fixed positive lag $h$ passes the weaker test: $0<H_{n+h}-H_n\le h/(n+1)\to 0$. The failing lag grows with $n$, as explained more generally by convergence from arbitrary variable-lag increments. ^[ref].

Every convergent sequence in a metric space is a Cauchy sequence: apply the triangle inequality to two late terms and their common limit of a sequence. The reverse implication requires completeness. It holds in the real numbers by completeness of the real numbers, but can fail in the rational numbers: the rational endpoints from the bisection method approaching $\sqrt{2}$ are a Cauchy sequence with no rational limit of a sequence. The existing construction in completeness of the real numbers shows how this happens. A Cauchy sequence is always a bounded sequence; in $\mathbb{R}$, boundedness gives a convergent subsequence by the Bolzano-Weierstrass theorem, and the pairwise condition forces the whole sequence to share its limit. ^[ref].

Cauchy's functional equation asks for functions $f:\mathbb{R}\to \mathbb{R}$ satisfyingThe identity must hold for every pair of real numbers, and a solution is an additive function. It says that combining two inputs before applying $f$ gives the same result as combining their outputs.^[ref]

For example, $f(x)=3x$ satisfies the identity because $3(x+y)=3x+3y$. At $x=2/3$ and $y=5/6$ the two sides giveFor positive widths, a rectangle of height three makes this visible: cutting its width into $x$ and $y$ partitions its area into $3x$ and $3y$. The same identity also holds for negative inputs, where $3x$ is a signed output rather than an ordinary area.

Every function $f(x)=cx$ with a fixed real number $c$ solves Cauchy's functional equation. The surprising question is whether these are all the solutions. Rational homogeneity of an additive function forces $f(q)=qf(1)$ for every rational number $q$, but reaching an irrational number requires an additional argument. Continuity at just one point or being a bounded function on an interval of positive length supplies that argument; without such a condition, discontinuous additive functions exist.^[ref]

This makes Cauchy's functional equation a useful test of the boundary between algebra and analysis: a rule about addition fixes all rational multiples, while a tiny amount of continuity fixes the entire real line. For example, the continuous exponential functional equation reduces to an additive function after taking a logarithm, so this result explains why its nonzero solutions are exponential functions.

Every Cauchy sequence of real numbers converges to a real number. Explicitly, the conditionimplies the existence of $L\in \mathbb{R}$ with $x_n\to L$. The hypothesis compares approximations with one another, without requiring a candidate answer. This makes completeness of the real numbers an existence principle: sufficiently consistent approximations cannot approach a missing destination. ^[ref].

The equivalent least-upper-bound property says that every nonempty set $A\subseteq \mathbb{R}$ bounded above has a supremum $s\in \mathbb{R}$. Precisely, every $x\in A$ satisfies $x\le s$, and for every $\epsilon >0$ some $x\in A$ satisfies $s-\epsilon <x$. The second condition excludes any smaller upper bound. No largest element of $A$ is required.

The rational numbers lack this property. The set $A=\{q\in \mathbb{Q}:q\ge 0,q^2<2\}$ contains one and has upper bound two, but has no supremum in $\mathbb{Q}$. A proposed rational supremum $s$ would have to satisfy $s^2=2$: if $s^2<2$, a sufficiently small rational increase still lies in $A$; if $s^2>2$, a sufficiently small rational decrease remains an upper bound. The irrationality of the square root of two excludes equality. In $\mathbb{R}$, its supremum is $\sqrt{2}$. ^[ref].

Construct this square root by the bisection method, starting with rational bounds $[l_0,u_0]=[1,2]$. At each step square the midpoint and retain the half whose endpoints bracket two after squaring. The first four resulting intervals are $[1,3/2]$, $[5/4,3/2]$, $[11/8,3/2]$, and $[11/8,23/16]$. After $k$ steps, $u_k-l_k=2^{-k}$ and $l_k^2<2<u_k^2$. Both endpoint sequences are Cauchy sequences because every later endpoint remains in the current interval. Completeness of the real numbers gives a common limit of a sequence $L$; continuity of squaring gives $L^2=2$. The midpoint approximates $L$ with error at most $2^{-(k+1)}$. Thus exact rational arithmetic produces certified accuracy while completeness of the real numbers supplies the exact answer.

Richard Dedekind approached completeness of the real numbers by filling gaps in the rational numbers with Dedekind cuts. In the preface to his 1872 Continuity and Irrational Numbers, he traced the problem to teaching differential calculus in 1858 and wanting arithmetic foundations for limits. His construction makes a missing boundary, such as $\sqrt{2}$, into a number defined by the separation it produces among rational numbers. ^[ref].

If $f:[0,\infty )\to \mathbb{R}$ is continuous and is an additive function, then $f(t)=tf(1)$. Additivity proves this first for nonnegative rational numbers; because $f$ is continuous, the identity extends to every nonnegative real number.

For a deterministic binary operation on an abstract data type, let $f$ be its specified operation on abstract values and $F$ the implementation on concrete states. For every permitted valid input pair $(r,s)$, require bothThe first condition preserves the representation invariant. The second makes a commutative diagram: either execute $F$ and then apply the abstraction function, or apply the abstraction function to both inputs and then execute the abstract operation $f$; both paths reach the same value. These conditions state functional correctness of a completed operation; termination is an additional obligation for algorithm correctness.^[ref]

For addition in the unreduced rational representation, chooseFor example, $F((1,2),(1,3))=(5,6)$ represents $5/6$, precisely the sum of $1/2$ and $1/3$. The short correctness argument uses nonzero denominators: $b\ne 0$ and $d\ne 0$ imply $bd\ne 0$, preserving the representation invariant, and

Now consider an incorrect implementation that uses addition on the numerators and multiplication on the denominators:It preserves the representation invariant for every valid input pair because its denominator is still $bd\ne 0$. Yet $B((1,2),(1,3))=(2,6)$ represents $1/3$, not the specified sum $5/6$. Even perfect checks of the representation invariant before and after this call would miss the error: the result is a legal representation of the wrong rational number.

The incorrect operation also exposes an accidental dependence on representation. Replace $(1,2)$ by the equivalent state $(2,4)$ while keeping $(1,3)$. The correct operation gives $(10,12)$, still representing $5/6$; the incorrect operation gives $(3,12)$, representing $1/4$ instead of its previous $1/3$. A correct addition must yield the same abstract result for equivalent inputs, although its concrete outputs may differ. This is why checks against the formal specification should compare abstract values, including unreduced representations and representations with a negative denominator, rather than demand identical stored pairs.

The calculation assumes exact integers. An implementation with bounded storage must additionally specify how it handles products and sums outside its supported range; the mathematical argument alone does not establish its functional correctness. The bounded queue with encapsulation illustrates the corresponding need to account for returned status values and failed operations, alongside the abstract state transition.

A family of pairwise disjoint real intervals of positive length is countable. Each interval contains a rational number in its interior by the density of the rational numbers. Fix an enumeration of the rational numbers and select the first member lying inside each interval. Disjointness makes this selection an injection into a countable set. The argument also applies to disjoint nonempty open subsets of the real line.

For pairwise disjoint measurable sets $E_n$, countable additivity means

The infinite series is the limit of its nonnegative partial sums. This controls an entire countable union, not merely each finite stage. If $q_1,q_2,\dots$ enumerate the rational numbers in $[0,1]$, their finite collections have Lebesgue measure zero, and countable additivity gives their whole union Lebesgue measure zero. Their being a dense set does not change this calculation.

The axiom makes no assertion about an arbitrary uncountable set of disjoint pieces. In particular, $[0,1]$ is the union of its singletons, each of Lebesgue measure zero, yet its Lebesgue measure is one. Extending additivity to all such unions would contradict interval length.

Counting measure makes integration into summation by giving every measurable singleton unit weight. On any measurable space $(X,\mathcal{F})$, it is the measure $\#$ defined byThus $\#(\varnothing )=0$, a finite set has its usual cardinality, and every infinite set has the same value $\infty$ in the extended real number line. In particular, countably infinite sets and uncountable sets are not distinguished by their counting measure. Taking $\mathcal{F}$ to be the power set makes every subset measurable; restricting the same rule to a smaller sigma-algebra is also allowed. ^[ref]

Why is this a countably additive measure? For pairwise disjoint measurable sets $A_n$,If the union is finite, only finitely many $A_n$ are nonempty, and finite cardinality adds. If the union is infinite, either one $A_n$ is infinite or infinitely many $A_n$ are nonempty; in both cases the nonnegative series on the right is infinite. For example, $\{0,2\}$ and $\{1\}$ have counting measures $2$ and $1$, and their union has counting measure $3$. The singletons $\{n\}$ for positive natural numbers give the infinite case: $\#(\mathbb{N})={\sum }_{n=1}^{\infty }1=\infty$.

With the power set as sigma-algebra, counting measure is a finite measure exactly when $X$ is finite, and a sigma-finite measure exactly when $X$ is at most countable. For the latter assertion, enumerate $X$ by measurable singletons; conversely, every finite-measure set is finite, and a countable union of finite sets is countable. Specifying the sigma-algebra matters: if $X=\mathbb{N}$ and $\mathcal{F}=\{\varnothing ,\mathbb{N}\}$, counting measure is not a sigma-finite measure, since the only measurable finite-measure set is the empty set.

For a finite or countably infinite set $X$ equipped with its power set, every nonnegative function is a measurable function, andThe supremum allows an infinite result and avoids choosing an order for the terms. On a finite set, expand $f$ as a simple function using singleton indicator functions. On a countably infinite set, enumerate the points and apply the monotone convergence theorem to finite truncations. Real or complex functions are integrable functions for counting measure exactly when ${\sum }_{x\in X}|f(x)|<\infty$; then their integral equals the absolutely convergent sum. This is the discrete counterpart of Lebesgue integration, developed further in series as a Lebesgue integral against counting measure. ^[ref]

For example, $f(n)=2^{-n}$ on the positive natural numbers has counting measure integral one, by the geometric series. The alternating harmonic series has a finite ordered sum but is not the integral of an integrable function for counting measure: its positive and negative parts both have infinite sums. Absolute convergence is what makes the finite integral independent of enumeration. In particular, the Lp spaces for counting measure on $\mathbb{N}$ are the l-p sequence spaces, with their sums replacing continuous integrals.

Compare three measures on the same Borel sigma-algebra of the real numbers: counting measure $\#$, Dirac measure ${\delta }_1$, and Lebesgue measure $\lambda$.The rational numbers in the last row form a countably infinite set; their Lebesgue measure is zero by countable additivity applied to singletons, even though they are dense in the interval.

These are different answers to different questions: counting measure asks how many points occur, Dirac measure asks whether the selected point occurs, and Lebesgue measure asks how much length occurs. A null set therefore depends on its measure. For counting measure, the only null set is the empty set, so equality almost everywhere is equality everywhere. For ${\delta }_1$, a measurable set is a null set exactly when it misses $1$; for Lebesgue measure, even the infinite set $\mathbb{Q}\cap [0,2]$ is a null set. Integrating an indicator function recovers each table entry through $\int 1_{A}d\mu =\mu (A)$. This lets the same Lebesgue integral framework handle point counts, point evaluation, and geometric length.