Measure and the complete square-integrable space
This companion retains the used measure arguments of AN03-P004, Banach
estimates, quotient spaces and compact parameter arguments. Its original
labels LM1–LM6, GM2–GM3, GM6 and LP3–LP4, LP10–LP11 are retained. The norm,
completeness and density assertions are selected only at p=1,2.
Young's inequality, weak derivatives and the rest of AN-03 are not required
by this selection. The full original AN-03 scope remains unchanged.
The scalar and compact-calculus proofs are the earlier
AN04-U001 prerequisite chain,
with its explicit real-field axioms and notation.
In particular, real completeness, the Archimedean property,
finite-dimensional continuity, complex arithmetic and absolute
series are supplied there. The rational density and enumeration steps are
written in M0 below. The smooth taper used in LP11 is proved in
U001, Appendix A.4.
The selection below supplies measure construction and convergence, rather
than taking those theorems as axioms.
This is a separate modified selection from the earlier AN-03 programme.
Original principal author and publisher: AN-03 course-writing
task / AN-03 local course project, 2026. Earlier modification: AN-03 course-writing task and OpenAI Codex.
Selection and the explicitly identified connecting arguments: GPT-6 Astra
(OpenAI), Ultra, 4 October 2026.
Original text: CC0.
The course chooses Zorn's maximality principle as an explicit logical axiom. Here is the exact selection map needed in the original complete-metric Baire argument. For any set-indexed family of nonempty sets (Ai)i∈I, consider partial functions c with domain a subset of I and c(i)∈Ai, ordered by extension. The empty function belongs to the poset. Every chain has an upper bound: its union is a function, since any two partial functions in the chain agree wherever both are defined, and every union value remains in its specified Ai. Zorn gives a maximal partial function. If its domain omits i, choose one element of that nonempty Ai; adjoining that one pair extends the function, a contradiction. Consequently
c:I⟶i∈I⋃Ai,c(i)∈Ai for every i∈I.(BZ1)
This proves the required choice consequence from the chosen axiom, without adding an unannounced sequence-selection hypothesis.
Here the selector is used only for the countable nonempty families of
near-minimal covers and of approximation choices. Subsequences of a given
Cauchy sequence can instead use the least natural index satisfying the
required tail bound. This selection makes no use of the Baire theorem.
For clarity, the elementary countability used in M2–M3 can be explicit.
Enumerate pairs (m,k)∈Z×N>0 in increasing
∣m∣+k, with any fixed finite ordering at each level. The resulting
sequence m/k includes every rational; repetitions do not matter.
Finite tuples are enumerated by the sum of their positive indices.
Thus rational coordinate boxes form a countable family. For a<b,
the Archimedean property supplies a positive integer N with
N(b−a)>1. Choose the least integer j>Na; it exists by bounding
Na between two integers and searching the finite integer interval.
Then Na<j≤Na+1<Nb, so j/N∈(a,b).
This proves the density used to select rational endpoints on both sides
of each coordinate. These are finite integer operations and natural
enumerations, not additional measure assumptions.
M1. The generating-class lemma
The following is the independent argument from AN03-P004, Section 16.2.
A Dynkin class on a set Z contains Z, is closed under relative complements, and is closed under countable disjoint unions. It is closed under differences of nested members: if A⊂B belong, complement the disjoint union A∪(Z∖B). Let P be an intersection-closed family containing Z, and let L be the intersection of all Dynkin classes containing P. This intersection is itself a Dynkin class. For A∈P, the sets B⊂Z with A∩B∈L form a Dynkin class. The whole-set condition uses A∈L; the complement condition uses the proved nested-difference rule inside A; disjoint unions use intersections with their disjoint parts. Intersection closure of P makes this class contain P, so it contains L. Fix now B∈L and make the same argument with the class of A satisfying A∩B∈L. The first argument shows that every A∈P belongs, and hence every A∈L belongs. Thus L is closed under all finite intersections. Complementation gives finite unions, and disjointifying a countable union by subtracting its preceding finite union gives every countable union. It follows that
P⊂D,D a Dynkin class⟹σ(P)⊂D.(GM6)
This implication has just been proved, rather than assumed as a convergence or product theorem.
M2. Completed Lebesgue measure
We now construct the measure input used in Section 15.1. Fix the original coordinates on Rn, n≥1. The covering boxes are bounded half-open coordinate boxes B=∏i=1n(ai,bi], ai<bi, with original geometric volume v(B)=∏i=1n(bi−ai). The empty box has volume zero. For every subset E⊂Rn, put
μ∗(E)=inf{j=1∑∞i=1∏n(bji−aji):E⊂j=1⋃∞i=1∏n(aji,bji]}.(LM1)
Finite covers are allowed by appending empty boxes. The empty cover gives μ∗(∅)=0. Every set has a cover, since a countable collection of bounded coordinate boxes covers the whole original space. Enlarging a set only reduces the choices of covers, so μ∗ is monotone. For a countable collection Ek, if ∑kμ∗(Ek) is finite, choose a cover of Ek with cost below μ∗(Ek)+ε2−k, for k≥1. Concatenating these original covers proves μ∗(⋃kEk)≤∑kμ∗(Ek)+ε. Let ε↓0. If that sum is infinite, the inequality already holds. Thus
μ∗(k⋃Ek)≤k∑μ∗(Ek).(LM2)
This proof uses only countable sums of nonnegative real numbers, not an integral or a convergence theorem for one.
The box volume in (LM1) is exact. One box covering itself gives μ∗(B)≤v(B). To prove the reverse inequality, take any countable box cover. If its cost is infinite there is nothing to show. Otherwise enlarge each covering box to an open box with added geometric volume less than ε2−j. This is possible by continuity of its full finite product in its endpoints. For 0<δ<21mini(bi−ai), the closed coordinate box Cδ=∏i[ai+δ,bi−δ] lies in the original B and has a finite subcover by these enlarged open boxes. The finite-subcover fact has a direct proof here. If a closed box had no finite subcover by an open cover, bisect all its original coordinate intervals. At least one of its 2n closed subboxes still has no finite subcover, because otherwise the union of the finite subcovers would cover the original box. Repeat inside that chosen subbox. Real completeness gives a point in all the resulting nested boxes: each coordinate's increasing lower and decreasing upper endpoints have the same limit, since their difference is its original side length times 2−k. The diameter at step k is the full (∑i2−2k(bi−ai−2δ)2)1/2, which tends to zero. One covering open set contains the limiting point and a small ball about it. Eventually the entire chosen box lies in that one set, contradicting its lack of a finite subcover. This proves exactly the compactness needed for Cδ.
For a finite family of open boxes covering Cδ, include every covering endpoint and every endpoint of Cδ in a finite coordinate grid, inside a bounded box containing them all. The product distributive law writes the full volume of each box as the sum of the grid-cell products contained in it. On the interior of each grid cell, membership in a covering open box is constant, because all its boundary coordinates are grid endpoints. Every grid cell inside Cδ is therefore contained, in its interior, in at least one covering box. Summing the full products, with their actual multiplicities, gives
i=1∏n(bi−ai−2δ)≤j in the finite subcover∑v(Bjenlarged)≤j=1∑∞v(Bj)+ε.(LM3)
Grid faces have a zero side length in this geometric calculation; no assertion about an already constructed measure is being used. First let ε↓0, then δ↓0. Every covering cost is at least the original full v(B). Taking its infimum proves μ∗(B)=∏i(bi−ai).
Define the measurable sets by the exact splitting condition
M={A: μ∗(E)=μ∗(E∩A)+μ∗(E∖A)for every subset E}.(LM4)
The reverse inequality to this equality always holds by (LM2), so only its other direction needs proof. Complements preserve (LM4). If A,B∈M, split first at A and then split both pieces at B. The resulting four original pieces have sum of outer measures μ∗(E). The three pieces outside A∩B cover its complement in E; (LM2) therefore proves the required inequality for A∩B. Thus finite intersections and finite unions preserve measurability.
For disjoint measurable Ak, repeated finite splitting gives, for every positive integer N,
μ∗(E)≥k=1∑Nμ∗(E∩Ak)+μ∗(E∖k=1⋃∞Ak).(LM5)
Let N→∞. The full sum bounds μ∗(E∩⋃kAk) from below by (LM2), proving (LM4) for their union. For an arbitrary countable union of measurable sets, replace its k-th set by its difference from the preceding finite union; finite intersections and complements have already proved these disjoint differences measurable. Their union is the original union, so M is a sigma-algebra. Taking E=⋃kAk in (LM5) and using (LM2) proves countable additivity of μ=μ∗∣M. No subtraction of two infinite numbers occurs.
Every covering box Q is in M. Indeed, subdivide any covering box Bj at all coordinate endpoints of Q. The half-open grid pieces partition Bj exactly. Each is either inside Q or outside it, and the sum of their full volume products is v(Bj), by the distributive law. The inside pieces cover E∩Q, and the outside pieces cover E∖Q, for any original cover of E. Thus each covering cost is at least μ∗(E∩Q)+μ∗(E∖Q). Taking its infimum proves (LM4). These boxes generate the Borel sigma-algebra: every open set is a countable union of coordinate boxes with rational endpoints whose closures are contained in it, since each of its points has an interior ball and rational endpoints can be chosen on both sides of each original coordinate. Hence every Borel set is measurable, with the exact box volumes proved in (LM3).
Every subset of an outer-measure-zero set is also measurable. For such a subset S, μ∗(E∩S)=0, and (LM2) and monotonicity give μ∗(E)=μ∗(E∖S). This is (LM4), with its first term zero. Therefore μ is complete. A coordinate hyperplane has outer measure zero: its bounded part with other coordinates in [−R,R] is covered by one box of thickness 2δ in its fixed coordinate and side lengths 2R+2δ in the others. Its full cost is
(2δ)(2R+2δ)n−1⟶0.(LM6)
The whole hyperplane is a countable union of these bounded parts, so (LM2) applies. Consequently every open, closed or half-open choice of endpoints on a bounded coordinate box differs only by a measurable null subset of its faces and retains the full original volume.
The completion is exactly the completed Borel measure, rather than a larger unexplained collection. If E∈M has finite measure, choose covers with costs tending to μ(E), enlarge their boxes to open boxes with additional total cost tending to zero, and denote their open unions by Ok⊃E. Additivity gives μ(Ok∖E)→0. Thus G=⋂kOk is Borel, contains E, and μ(G∖E)=0. Every measurable null set H has a Borel null superset: make the same open-cover construction with total cost below 2−k, and intersect the resulting open sets. Apply this to H=G∖E. It follows that E differs from a Borel set by a subset of a Borel null set. For infinite μ(E), apply the finite construction to E∩Qk, where bounded coordinate boxes Qk increase to the whole original space. Each has finite measure by (LM3). The countable union of the resulting Borel supersets is a Borel superset of E, and its difference from E lies in the countable union of the Borel null supersets just constructed. This again has measure zero. Conversely, completeness has already shown that every Borel set changed on a subset of a Borel null set belongs to M.
Finally, this construction is the unique completed Borel measure with the stated coordinate-box volumes. On a bounded coordinate box Q, suppose two finite Borel measures have these volumes. The sets on which they agree form a Dynkin class: agreement holds on Q, relative complements subtract from its finite original volume, and disjoint countable unions use countable additivity. The coordinate rectangles form an intersection-closed generating class. The independent Dynkin-class argument in Section M1 above, which uses only these set operations, makes agreement extend to all Borel subsets of Q. Exhausting by bounded Qk and writing their increasing union as successive disjoint differences proves agreement on all Borel sets. Both completions contain exactly the same Borel null sets and all their subsets, as proved above; their completed measures therefore agree as well. Thus (LM1)–(LM6) construct precisely the countably additive completed Lebesgue measure used in (LP1)–(LP19), with its actual original coordinates, full products, face contributions and outer-measure covers.
M3. Measurability and the integral
For an extended real function, measurability means that all inverse images of open rays are measurable. It is enough to check rational endpoints: an arbitrary open ray is a countable union of the appropriate rational rays. Countable suprema and infima are measurable, since
{nsupfn>t}=n⋃{fn>t},{ninffn<t}=n⋃{fn<t},nliminffn=Nsupn≥Ninffn.(GM2)
To obtain the other ray for a given extended real function, use the complement of a non-strict ray, itself a countable intersection of strict rays. Consequently a pointwise limit of measurable real functions, including an infinite limit, is measurable. For complex functions apply the assertion to both real coordinates; the Borel sets of the complex plane are generated by the rational-coordinate rectangles. Finite sums of measurable real functions and products wherever their extended values are defined are measurable: their pair map has measurable inverse images of rational rectangles and hence of every open set, and finite real addition and multiplication are continuous. This gives in particular every finite-valued simple function and its level sets. Nonnegative sums with infinite limits follow by increasing finite sums and (GM2).
For a nonnegative finite-valued simple function s=∑j=1rcj1Aj, with disjoint measurable Aj and finite cj≥0, define its integral to be ∑jcjμ(Aj). The convention 0⋅∞=0 records the fact that a zero value contributes zero, even on a set of infinite measure. Two presentations give the same answer: intersect their finite partitions, including the zero-valued complement, and use finite additivity on each original part. On this common partition s≤t gives ∫s≤∫t; sums and finite positive scalar multiples have their exact additive integral. For a nonnegative measurable f, define
∫Xfdμ=s nonnegative, finite valued, simples≤fsup∫Xsdμ,sn(x)={min(2n,2−n⌊2nf(x)⌋),2n,f(x)<∞,f(x)=∞.(GM3)
Each sn has finitely many measurable levels. The next dyadic grid retains every earlier grid value and its truncation is higher, so sn↑f. This is an approximation to the original f; neither the measure nor f is replaced in the conclusion.
Here is monotone convergence directly from that definition. If 0≤fn↑f, monotonicity gives L=limn∫fn≤∫f. For an arbitrary nonnegative simple s≤f and 0<t<1, let En={fn≥ts}. These increase, and their union contains {s>0}: at a point where s>0, the limit f≥s>ts forces an eventual such inequality. On each of the finitely many positive levels of s, measure continuity gives ∫s1En↑∫s. This includes an infinite level-set measure; zero levels still contribute zero. Since ∫fn≥t∫s1En, we have L≥t∫s. If ∫s=∞, this already forces L=∞; otherwise let t↑1. Taking the supremum over s proves
0≤fn↑f⟹∫fndμ↑∫fdμ,∫(f+g)dμ=∫fdμ+∫gdμ.(GM4)
For the additive assertion, use the increasing simple approximations of both original functions in (GM3). Their sums increase to f+g, and every simple integral is additive. Positive homogeneity follows first for simples and then by the same limit. Applying (GM4) to the finite partial sums proves integration of an arbitrary countable nonnegative sum. No sigma-finiteness is needed in this paragraph.
If ∫g<∞, the set on which g=∞ has measure zero: n1{g=∞}≤g gives nμ{g=∞}≤∫g for every positive integer n. Integrating the four nonnegative parts of a complex measurable h with ∫∣h∣<∞ defines its integral and proves linearity, because all those integrals are finite. Its triangle inequality follows without a pointwise choice of phase: if I=∫h=0, use the constant c=I/∣I∣ and Re(ch)≤∣h∣; if I=0, the inequality already holds.
For nonnegative fn, put gN=infn≥Nfn. These are measurable by (GM2), increase to liminffn, and satisfy ∫gN≤infn≥N∫fn. Formula (GM4) proves Fatou's inequality. If hn and h are measurable complex functions, hn→h almost everywhere and ∣hn∣≤g almost everywhere with ∫g<∞, take the countable union of their measurable exceptional null sets and the null infinite-value set of g. Change all the functions to zero on that measurable null set. This preserves all original integrals. Now ∣h∣≤g everywhere, and Fatou applies to 2g−∣hn−h∣. Additivity expresses its finite integral as 2∫g−∫∣hn−h∣. Fatou therefore gives
∫∣hn−h∣dμ⟶0,∫hndμ⟶∫hdμ.(GM5)
Every subtraction here is of finite integrals. If μ(X)<∞ and ∣hn∣≤M<∞, use the original constant majorant M1X, whose integral is Mμ(X), to prove bounded convergence. For M=0 or μ(X)=0 this integral is exactly zero. This proves the entire convergence entry used for one-dimensional Lebesgue measure, and also its stated general finite-measure version.
The labels GM4–GM5 above prove the monotone, Fatou and dominated convergence
statements denoted LP1–LP2 in the original Section 15.1. In the retained
paragraphs below, a reference to LP1 means exactly this proved GM4.
M4. Product integration
Here is product integration with its actual measurability requirement. In a fixed finite coordinate box Q=Qx×Qy, let C consist of the Borel sets E⊂Q whose sections Ex are measurable, whose section measure is a measurable function of x, and which satisfy
∣E∣=∫Qx∣Ex∣dx.(LP3)
Coordinate rectangles belong to C, by the full box-volume formula. The whole box belongs. Relative complementation preserves membership because every section measure is at most the finite ∣Qy∣, so both sides subtract from ∣Qx∣∣Qy∣. Disjoint countable unions preserve membership by countable additivity and (LP1), which also proves measurability of the sum of the section measures. Thus C is a Dynkin class containing the rectangles.
For completeness, the needed class argument is finite and exact. Let L be the smallest Dynkin class containing the rectangles. A Dynkin class is closed under differences of nested members: if A⊂B, use the disjoint union A∪(Q∖B) and complement. For a rectangle A, the sets B for which A∩B∈L form a Dynkin class and contain the rectangles, since intersections of rectangles are rectangles or empty. Hence they contain L. Fixing now any B∈L and making the same argument in A shows that L is closed under all finite intersections. Complements give finite unions. Disjointifying a countable union by subtracting its finitely many preceding members then shows closure under countable unions. Therefore L is a sigma-algebra containing the rectangles, which generate the Borel sets of Q. This proves (LP3) for every Borel set in the box.
Increasing simple approximation and (LP1) now prove nonnegative Tonelli on Q. Exhausting both original spaces by expanding coordinate boxes proves it on Ra×Rb. A Lebesgue measurable set differs from a Borel set by a subset of a Borel null set. For that null set, (LP3) says that its sections are null outside a null set of x's. Completeness of the section measure makes every subset section measurable there. On the exceptional null set one may choose the value zero for the inner integral. Thus completed Lebesgue measurability gives the same iterated identity almost everywhere; it does not assert measurable sections at every exceptional point. Applying this argument to simple approximations proves the completed version for nonnegative functions. Finally, apply it to ∣h∣ when ∫∣h∣<∞, and to the positive and negative parts of the real and imaginary components. All these integrals are finite. We obtain the full identities
∫h(x,y)dxdy=∫(∫h(x,y)dy)dx=∫(∫h(x,y)dx)dy,(LP4)
for nonnegative h, with possibly infinite integrals, and for absolutely integrable complex h. Sections and inner integrals have their almost-everywhere meanings in the completed case.
M5. The two required norms
This is the p=1,2 specialization of AN03-P004, Section 15.2, with its
scalar step displayed explicitly. Functions are identified when they agree
almost everywhere. Set ∥f∥p=(∫∣f∣p)1/p.
For a nonnegative measurable g, an integral of zero forces g=0
almost everywhere: j−11{g>1/j}≤g, so each displayed level set
is null, and their countable union is {g>0}. This proves definiteness
of both norms on those equivalence classes. Their homogeneity follows from
positive homogeneity of the integral.
For L2 functions of nonzero norms, apply
2ab≤a2+b2, which is (a−b)2≥0, to
a=∣f∣/∥f∥2, b=∣g∣/∥g∥2, and integrate. This proves
∫∣fg∣≤∥f∥2∥g∥2.(M1)
If a norm is zero, its function vanishes almost everywhere, and the same
inequality holds. Since ∣f+g∣2≤2∣f∣2+2∣g∣2, the sum belongs to
L2. Expansion of its squared modulus and (M1) give
∥f+g∥22≤∥f∥22+2∥f∥2∥g∥2+∥g∥22.
Taking nonnegative square roots proves the triangle inequality. For L1
it follows by integrating the scalar triangle inequality. Finally, the
complex integral triangle inequality was proved in M3 by multiplication
by a single constant phase. These arguments establish every norm
inequality used below, without a general exponent or convexity theorem.
M6. Completeness
For p=1 or p=2, let (fj) be norm Cauchy. Choose a subsequence (fjk) with ∥fjk+1−fjk∥p≤2−k. The increasing finite sums GM=∣fj1∣+∑k=1M∣fjk+1−fjk∣ have norms at most ∥fj1∥p+∑k=1M2−k, by Minkowski. Equation (LP1), applied to GMp, proves that their pointwise limit G is in Lp and finite almost everywhere. Thus the series of original differences converges absolutely almost everywhere, giving a measurable limit f. The same argument for the tail gives
∥f−fjk∥p≤ν=k∑∞∥fjν+1−fjν∥p≤ν=k∑∞2−ν.(LP10)
One obtains the first bound by dominating the pointwise difference by that nonnegative tail and passing its finite partial sums through (LP1). The Cauchy property and the triangle inequality then give convergence of the entire sequence to f.
M7. Compact smooth density
The smooth density assertion has a different domain: p=1,2 on Rn. First truncate the original f by ∣x∣≤R and ∣f(x)∣≤M. Dominated convergence applied to ∣f∣p proves convergence of these truncations as R,M grow. On the resulting bounded support and bounded complex range, a finite square grid of mesh δ gives a measurable simple function a=∑j=1Jcj1Ej, with ∣f−a∣≤2δ. Each Ej has finite measure, so the Lp error is at most 2δ times the support measure to the power 1/p.
For a measurable E with finite measure, its outer-measure definition gives a countable coordinate-box cover with total volume less than ∣E∣+ε. Enlarge its boxes to open boxes, choosing the extra volume of box j less than ε2−j. Their open union O contains E and has ∣O∖E∣<2ε. The finite unions FJ of the first J boxes increase to O. Since ∣O∣<∞, (LP1) gives ∣O∖FJ∣→0. Therefore ∣E△FJ∣≤∣O∖E∣+∣O∖FJ∣, proving approximation in measure by a finite union of bounded coordinate boxes.
Write one such union as F=⋃j=1J∏i=1n(aji,bji). For δ>0 smaller than half every side length, choose one-dimensional smooth functions between zero and one, equal to one on [aji+δ,bji−δ] and supported in (aji−δ,bji+δ). Their product is θj,δ, and Θδ=1−∏j=1J(1−θj,δ) is compact smooth, between zero and one. The difference from 1F is supported in the union of the full box layers. Hence
∥Θδ−1F∥pp≤j=1∑J[i=1∏n(bji−aji+2δ)−i=1∏n(bji−aji−2δ)]⟶0.(LP11)
Coordinate faces have measure zero: cover a bounded face by a box with arbitrarily small thickness and use the full volume product; unbounded faces are countable unions of bounded ones. Thus open or closed endpoint choices do not alter this estimate. Combining the finite-union approximation with (LP11) proves compact smooth approximation of each original indicator 1Ej. Minkowski gives the full coefficient bound ∥∑jcj(1Ej−Θj)∥p≤∑j∣cj∣∥1Ej−Θj∥p. Keeping these finitely many coefficients and then taking the preceding truncation and grid errors to zero proves density of Cc∞ in Lp.
The taper choices in LP11 use the explicit U001 construction cited above:
the product of two translated, scaled copies of its smooth step function
is one on the smaller interval and zero outside the larger interval.
Consequently the smooth density proof has no unproved mollification input.
The same construction gives simultaneous density for L1∩L2.
Truncate so that both tail norms are small, choose the range grid so that
both norm errors are small, and choose each of the finitely many box-layer
widths to meet both remaining error bounds. A finite minimum of positive
widths meets both conditions. Thus for f∈L1∩L2 there are
vj∈Cc∞ with ∥vj−f∥1+∥vj−f∥2→0.
M8. Compatibility with the earlier integral
This connecting proof identifies the new measure integral with the
continuous and Schwartz integrals used in U001. It does not assume that
the two constructions agree. On a bounded coordinate box Q, partition
into smaller coordinate boxes. A continuous real function has lower and
upper simple functions on that partition, with integrals equal to its
lower and upper Darboux sums, because M2 proves the exact box volumes and
null faces. Uniform continuity on Q makes the difference of those sums
at most ∣Q∣ times the maximum cell oscillation, which tends to zero.
Monotonicity traps the Lebesgue integral between the same sums. Therefore
it equals the earlier Riemann integral. Apply this separately to the real
and imaginary parts.
For a Schwartz function v, fix an integer N>n. Its bound
∣v(x)∣≤CN⟨x⟩−N on the dyadic regions
2j≤∣x∣∞<2j+1 bounds their absolute integrals by
CN′2j(n−N), using the enclosing box volume. The convergent
geometric tail tends to zero for both constructions of the integral.
Equality on expanding finite boxes therefore proves equality of the
Schwartz integrals, including every polynomial times a Schwartz
derivative. The same reasoning on the product space treats the absolute
products in the U001 Schwartz Parseval proof. Its Fourier inversion and
Plancherel formulas consequently apply with exactly this Lebesgue
measure, including their original 2π factors.
Free source comparisons
Terence Tao, An introduction to measure theory, the
author-linked preliminary draft hosted December 2012:
Lemma 1.2.6 (box volume), Lemma 1.2.12 (outer approximation),
Theorem 1.4.44 and Corollary 1.4.47 / Theorem 1.4.49 (convergence),
Theorem 1.7.3 (outer-measure construction), and Theorems 1.7.15,
1.7.18 and 1.7.21 (product integration).
The companion proves its own completion, generating-class and null-section
steps, including steps left as exercises in that draft.
Tao, 245B, notes 3: Lp spaces,
9 January 2009, Lemma 1, Propositions 1–3 and Remark 7, supplies the free
norm, completeness and simple-density comparison. M6 supplies the full
Cauchy-subsequence step; M7 supplies the smooth approximation itself.
These human readings are mathematical comparisons, not imported prose or
substitutes for the programme proofs above. The free draft and blog are
not included in this component.