Diameter is a metric scale
Objective: Checkpoint F01.01: without looking back, name every object type in Diameter is a metric scale, reproduce the exact finite row, distinguish its finite evidence from the required limit or infimum, state the theorem bridge with all hypotheses, and identify the first invalid inference after the mutation.
F01.01 begins with an object declaration, not a formula. Name the underlying set or group, metric, measure, scale range, exponent, curve family, map, and exceptional set. Then say in ordinary language what “Diameter is a metric scale” measures: diameter records the largest declared metric separation inside one covering set, not its coordinate width unless those agree A symbol without source, target, scale, or quantifier is not yet usable mathematics.
Read the types aloud before calculating. A radius is a length, a covering number is a count, a Hausdorff content is an infimum of scale powers, a measure assigns mass, an energy penalizes oscillation, a modulus optimizes densities over an entire curve family, and a distortion compares ratios under a map. Adding quantities of different type is an error even when the numerals look compatible.
The chapter lives inside diameter-controlled covers, scale cutoffs, s-cost, Hausdorff content and measure, covering numbers, box slopes, and finite-versus-asymptotic evidence. Separate finite evidence from an asymptotic definition: one grid is not a dimension, one energy row is not a closed form, one tangent candidate is not a unique tangent, one admissible density is not the modulus, and one distortion measurement is not quasiconformality. Write the limiting operation and its order explicitly.
Keep four ledgers. The scale ledger records radii, diameters, cutoffs, and dilation weights. The mass ledger records the measure and normalization. The path ledger records admissible curves, horizontal controls, or test triples. The theorem ledger records doubling, Ahlfors regularity, Poincaré, connectivity, separation, completeness, or graded-group hypotheses. Conclusions may move only when the relevant ledger is complete.
Use the exact finite calibration: F01.01: cover a finite set by 7 squares of side 1/2. The declared s-cost is 7·(1/2)^s. Keep count, diameter convention, exponent, and scale cutoff in separate columns; changing squares to balls can alter constants without changing the recorded scale law. Retain exact fractions, powers, logarithms, and radicals until the final display. A decimal is evidence about one chosen precision; it does not replace an equality, a limit, or an error bound. Recompute the same row from the definition before invoking a named theorem.
Coverings require an order of quantifiers. Fix a maximum diameter, infimize the total s-cost over all admissible covers, and only then let the cutoff shrink. Reversing these operations can change the object or make it undefined. For box counts, name the grid or covering convention and distinguish limsup from an actual limit.
Measure growth is not inferred from a picture. Ahlfors Q-regularity is a two-sided estimate at every permitted center and radius with uniform constants. A Frostman upper bound is one-sided and usually attached to a constructed measure. Doubling compares nested balls but does not by itself identify one exact power Q. State which implication is actually available.
Self-similarity is a map system, not decorative repetition. Record every contraction, composition word, fixed point, cylinder, invariant measure weight, and overlap assumption. The equation Σr_i^s=1 supplies a similarity exponent; equality with Hausdorff dimension needs a justified separation theorem or a separate overlap analysis.
Analysis on a fractal needs an energy domain as well as a set. State the approximating graphs or difference quotients, renormalization factors, compatibility across levels, closure norm, constants, and boundary conditions. A limiting Laplacian is an operator with a domain; writing a stencil on one graph does not create the operator.
Heat and diffusion carry several dimensions. Hausdorff dimension controls volume growth in the declared metric; walk dimension controls time-to-distance scaling; spectral dimension controls return-probability or eigenvalue growth under additional theory. These numbers can differ. Do not import Euclidean t≈r² scaling into a fractal without evidence.
In a sub-Riemannian model, allowed velocities lie in a horizontal distribution. Declare the vector fields, their brackets, bracket-generating step, inner product, control convention, and Carnot–Carathéodory length. The ambient coordinate difference is not automatically the travel distance, and a vertical displacement can arise from a horizontal commutator loop.
Carnot dilations assign different weights to different layers. The homogeneous dimension is the weighted sum of layer dimensions and governs Haar-volume scaling; it generally exceeds topological dimension. A Euclidean Jacobian, an ordinary derivative, or isotropic scaling cannot be substituted for the graded version without a comparison theorem.
Modulus is a global optimization over a curve family. First verify that a candidate density charges every required curve, then integrate its p-th power against the declared measure, and finally infimize. An upper bound comes from one admissible density; a lower bound needs a dual, geometric, Poincaré, or Loewner argument.
Loewner control connects relative separation of continua to a modulus lower bound under precise dimension and regularity assumptions. It is not a synonym for connectedness. A space can contain many curves yet fail the required quantitative bound; a disconnected or badly pinched space can make the connecting family empty or negligible.
Quasiconformal, analytic, modulus, quasisymmetric, and quasi-Möbius formulations are distinct definitions before an equivalence theorem is proved. Name homeomorphism, regularity, dimension, Loewner, connectivity, and measure hypotheses for each bridge. Never change definition silently because the next calculation is easier in another language.
The bounded theorem route is “monotonicity in the cutoff and exponent organizes Hausdorff content; under declared boundedness and covering conventions, limsup and liminf of normalized covering counts give box-type bounds” Identify exactly where each hypothesis enters, whether the conclusion is local or global, and whether constants depend on dimension, regularity, Poincaré, separation, or distortion data. A named result is not permission to erase those dependencies.
Run the required failure mutation: swap infimum and limit, omit the diameter convention, infer an exact dimension from two grid rows, or treat a finite cover as optimal. Stop at the first missing definition or hypothesis. Keep the strongest valid remainder—often a finite upper bound, one-scale estimate, candidate exponent, local statement, or conditional implication—and state one explicit nonclaim.
Reconstruct F01.01 by a second route: change the cover, solve a finite resistance network, enumerate a bracket loop, integrate a different admissible density, or test inverse triples. Compare exact intermediate ledgers rather than only the final scalar. Agreement caused by the same hidden convention is not independent verification.
Separate theorem proof, exact finite computation, numerical approximation, and empirical model claim. A script can audit counts, graph energies, dilation tables, or candidate distortion ratios. It cannot by itself prove an uncountable-cover infimum, almost-everywhere differentiability, heat-kernel asymptotics, uniformization, rigidity, or quasiconformal equivalence.
Finish with one sentence per ledger: what the scale means, what mass is being measured, which paths or triples are quantified, which theorem is allowed, and what fails after mutation. If any sentence cannot be spoken without pointing vaguely at a formula, return to the definition rather than memorizing the symbol.
Bounded theorem F01.01: after the scale, mass, path, and hypothesis ledgers for Diameter is a metric scale pass, the chapter may use only “monotonicity in the cutoff and exponent organizes Hausdorff content; under declared boundedness and covering conventions, limsup and liminf of normalized covering counts give box-type bounds”; no stronger dimension identity, analytic equivalence, regularity, uniformization, rigidity, or uniqueness follows without an additional theorem.
Declare the full F01.01 datum: host set or group, metric, measure, scale range, exponent, map, curve family, and exceptional set.
Translate “Diameter is a metric scale” into the typed meaning “diameter records the largest declared metric separation inside one covering set, not its coordinate width unless those agree” before manipulating a symbol.
Recompute the exact finite ledger from its definition and preserve fractions, powers, logarithms, radicals, signs, and normalization.
Separate one-scale evidence from every infimum, supremum, limsup, almost-everywhere, or all-curves quantifier in the target statement.
Verify the scale, mass, path, and theorem ledgers independently; do not let a geometric picture supply a missing hypothesis.
Apply only the bridge “monotonicity in the cutoff and exponent organizes Hausdorff content; under declared boundedness and covering conventions, limsup and liminf of normalized covering counts give box-type bounds,” naming every regularity, connectivity, separation, completeness, or graded-structure input used.
Audit the conclusion type and constants: local or global, upper or lower, exact or comparable, attained or only infimized.
Rebuild the finite record by a genuinely independent cover, network, horizontal path, density, or inverse-map calculation.
Trigger “swap infimum and limit, omit the diameter convention, infer an exact dimension from two grid rows, or treat a finite cover as optimal,” stop at the first lost hypothesis, and state the strongest surviving claim plus one explicit nonclaim.
Worked reconstruction F01.01: starting only from the raw record “F01.01: cover a finite set by 7 squares of side 1/2. The declared s-cost is 7·(1/2)^s. Keep count, diameter convention, exponent, and scale cutoff in separate columns; changing squares to balls can alter constants without changing the recorded scale law.,” derive Diameter is a metric scale, fill the four ledgers, justify the bounded theorem bridge, repeat by a second route, then activate the unit mutation without importing a source example or diagram.
- Write the raw scale, point, edge, cell, curve, or triple rows with no polished totals.
- Declare metric, measure, exponent, orientation or layer weights, and every normalization constant.
- Compute the finite covering, growth, energy, length, modulus-cost, or distortion row exactly.
- Check all quantifiers and identify which rows are merely candidates for a limit or infimum.
- Use the stated theorem bridge only after its hypotheses receive an explicit pass or fail entry.
- Repeat by an independent construction and compare intermediate ledgers before comparing conclusions.
- Apply the mutation, locate the first invalid inference, and report the bounded surviving result.
Result: Answer F01.01: the exact retained record is “F01.01: cover a finite set by 7 squares of side 1/2. The declared s-cost is 7·(1/2)^s. Keep count, diameter convention, exponent, and scale cutoff in separate columns; changing squares to balls can alter constants without changing the recorded scale law.” It supports the typed meaning “diameter records the largest declared metric separation inside one covering set, not its coordinate width unless those agree” at the declared finite scales. The theorem step is conditional on “monotonicity in the cutoff and exponent organizes Hausdorff content; under declared boundedness and covering conventions, limsup and liminf of normalized covering counts give box-type bounds”; after “swap infimum and limit, omit the diameter convention, infer an exact dimension from two grid rows, or treat a finite cover as optimal,” stop at the first missing hypothesis and retain only the finite or conditional conclusion.