Source and verification
This article explains family 357 of the October 6, 2026 OpenAI collection. Research conclusions are attributed to its manuscripts. The review covers statements, introductions, and selected proof mechanisms; it is not an independent verification of the complete proofs.
🏷️ Tangent spaces and open coordinate charts
A metric space can look increasingly Euclidean under magnification without a chosen coordinate system having uniformly bounded distortion. Family 357 concerns the gap between these two statements. Its manuscript claims that every regular point of a noncollapsed RCD space has an open bi-Lipschitz coordinate neighborhood, with distortion bounded in terms of the dimension alone. The proof constructs successive corrections of harmonic coordinates and controls their cumulative effect on distances. (OpenAI, 2026)
For a pointed metric space , a tangent at is a pointed Gromov–Hausdorff limit of rescaled spaces with . Gromov–Hausdorff convergence means, roughly, that bounded regions can be matched with distance errors tending to zero. A point is -regular when every such tangent is Euclidean with its usual distance and distinguished origin.
A map is an -bi-Lipschitz chart if it is a homeomorphism and
Here both and must be open. The distance on is the original ambient distance restricted to pairs in , not the infimum of lengths of curves constrained to stay in . This distinction matters when proving a bound for every pair of points.
The background condition consists of the full curvature-dimension condition , formulated through optimal transport, together with quadratic Sobolev energy. The quadratic energy gives a Hilbert-space calculus of weak gradients. On an unweighted smooth -manifold, this is the framework corresponding to a lower Ricci bound .
In this paper noncollapsed means that the reference measure is exactly the -dimensional Hausdorff measure . The spaces are complete, separable, and geodesic, and their measure has full support and is finite on bounded sets. The exact measure, integer dimension, and finite-dimensional condition remain part of the theorem.
Open bi-Lipschitz charts, as stated in the manuscript
For each integer , there is a constant such that every -regular point of every noncollapsed space has an open neighborhood bi-Lipschitz homeomorphic to an open subset of , with constant . The neighborhood can depend on the space and point. The distortion constant depends only on , while may be any real number. (OpenAI, 2026)
This is stronger than countable rectifiability, which covers almost every point by measurable pieces with bi-Lipschitz parametrizations. It is also stronger than an open bi-Hölder chart. It does not claim that the metric tensor in the resulting coordinates is Hölder continuous, or that the coordinate functions have bounded Laplacians.
🏷️ Why small errors at every scale are insufficient
Suppose a construction changes a length by a factor at dyadic scale . Even if , the cumulative product can diverge. For example,
Qualitative Euclidean approximation at small scales therefore does not automatically give a uniform bi-Lipschitz constant. A second obstacle appears when the available errors are energies : summability of does not imply summability of . The sequence demonstrates the difference.
The manuscript permits the matrix describing the required coordinate stretching to grow without bound as the scale decreases. It instead proves a directional estimate for actual differences of coordinate values, and uses that estimate without summing square roots of the energy defects. This is the main connection between the geometric and analytic parts of the proof.
🏷️ Harmonic functions, Gram matrices, and initial open coordinates
A weakly harmonic function satisfies , with the Laplacian defined by integration by parts against test functions. Harmonic functions on the spaces in question have local Lipschitz and second-order Sobolev regularity. After sufficiently strong magnification at the regular point, the paper constructs a harmonic column
approximating ordinary Euclidean coordinates on a large region. The curvature lower bound rescales from to when distances are divided by . Thus its negative part can be made arbitrarily small on a fixed working region.
Define the Gram matrix of the weak gradients and its ball averages by
In Euclidean coordinates, . In the manuscript’s construction, each is positive definite, and the normalized map
is close to a Euclidean coordinate map on the corresponding rescaled ball. The approximation is uniform over nearby centers and all dyadic scales once the initial magnification is sufficiently strong. Nearby average matrices are relatively close. Across many scales their variation has an arbitrarily small power bound, but no uniform positive lower bound independent of scale is assumed.
The normalized maps already give an open homeomorphism on a working ball. Injectivity follows by testing each distinct pair at a scale comparable to its distance. For openness, consider a small ellipsoid around measured in the quadratic form . Approximate Euclidean surjectivity produces successive points whose coordinate residuals shrink at radii . Their displacements form a geometric series. Completeness gives a limit point with the desired coordinate value, and a strict interior margin keeps it inside the ball.
This supplies an open Euclidean domain on which ordinary smooth corrections can be defined. It does not yet give the final uniform distance bound. (OpenAI, 2026)
🏷️ Positive Bochner mass and accumulated stretching
On a smooth manifold with , the Bochner formula for harmonic gives
The corresponding RCD inequality is measure-valued. Applied to every linear combination of the coordinates, it defines a positive semidefinite matrix-valued measure
For a vector , the scalar measure is nonnegative and controls the squared Hessian of . The measure may have a singular part, which remains part of the estimates.
Fix an enlargement factor . The scale-normalized mass matrix and its expression on coordinate differences are
For a positive matrix , write and . The two inverse factors in are essential: it is a quadratic form on differences in the space of coordinate values.
The paper compares these local masses with heat averages of . If is the heat semigroup and a cutoff on a much larger region, put
The small correction absorbs cutoff and curvature errors. Positivity of the resulting time derivative makes decrease as increases; hence increases. Relative comparison with also gives
The forms describe how much stretching is needed at each scale. They need not converge to a finite matrix.
For boundedly many nearby patches, let be the sum of their and let be a weighted sum with weights in . Require one weight-one patch whose enlarged mass ball contains the testing ball. The manuscript proves, with a fixed constant ,
These cumulative estimates allow unbounded stretching while measuring all accumulated mass against the appropriate final-scale form. Matrices at different scales need not commute. The inverse-increment argument conjugates a single positive decrement by , applies scalar spectral inequalities to that one matrix, and then sums quadratic forms. Simultaneous diagonalization is not used. (OpenAI, 2026)
🏷️ Summable directional defects from squared distance
The second main input is more specific than a bound on the total size of . For nearby points , it states
The same nonnegative defects work simultaneously for all permitted centers and scales. Their sum becomes arbitrarily small with the initial magnification. (OpenAI, 2026)
The starting point is the squared distance . Laplacian comparison gives a positive defect measure
Solve a Dirichlet problem to replace by with constant Laplacian and the same boundary values on an enlarged ball. The normalized source mass, together with , defines an energy defect .
Its summability comes from volume comparison. Write . Radial integration by parts expresses the mass of in terms of a drop of between fixed multiples of . Summing over dyadic radii telescopes. The small-scale volume density is at most the Euclidean one at every center, while the initial-scale volume ratio is uniformly nearly Euclidean. The curvature correction is summable because . Neighboring centers need not themselves be regular.
The Poisson replacements have controlled Hessian defect from the metric, including the full measure contribution. Radial derivatives of the harmonic coordinate span can then be approximated by affine combinations of those coordinates. An improvement recurrence across scales, with exponentially decaying weights, enlarges to summable defects .
The sharp estimate compares replacements centered at two points. Their difference is harmonic because they have the same constant Laplacian. In normalized coordinates , let this difference be , and project it onto the affine span of . If
the required residual estimate is , with the coefficient equal to up to .
A radial transport estimate preserves this squared order of error. It is applied to the unnormalized residual before dividing by its small norm . Its crucial error has the form , where is an annular squared norm. Young’s inequality absorbs part of and leaves .
If were unbounded, the normalized residual would converge to a nonzero Euclidean harmonic function orthogonal to all affine functions and satisfying an Euler equation
The operator on the left multiplies a homogeneous term of degree by . Thus all terms of degree at least two vanish. The limit is affine, contradicting its orthogonality and unit norm. This yields the sharp projection estimate. Positivity and polarization of the Bochner measure turn the coefficient error into an mass error, producing the directional bound with the required powers of .
🏷️ Correcting coordinates in their Euclidean value space
At scale , choose a finite net of patch centers and smooth cutoffs supported in normalized ellipsoids. Only boundedly many patches meet each point. In each patch choose one fixed coordinate value whose defect is within a factor two of the patch infimum. An arbitrarily small positive, summable floor in permits this choice without continuity of or a selection theorem.
Define a smooth covector field on value space by
Its derivative has leading part , with cutoff errors controlled by directional pinching. The coordinate corrections are
All derivatives here are ordinary Euclidean derivatives on the fixed open set . The construction does not invert the weak differential of or differentiate the scale forms .
The inverse transpose makes the main change in squared lengths equal to . Indeed, for and , direct differentiation gives
The second term is the delicate one. A crude bound followed by summation of would lose the available summability. Instead fix a testing point and direction and set
The paper derives
The factor comes from the next dyadic radius; monotonicity of helps rather than hurts. Convolution with the geometric sequence is bounded on , so the cumulative matrix estimate implies
Cauchy–Schwarz now bounds the troublesome sum by
Only enters. Combining the analogous cutoff and squared-increment estimates with the leading positive sum closes the metric bounds
The update loses a derivative, so the proof also maintains bounds for every derivative order, using smooth cutoffs with controlled factorial growth. These are Gevrey-type bounds: the th derivative is allowed to grow like a fixed exponential in times a fixed power of . Matrix inversion preserves the required exponential base. Changing to the next radius supplies a factor , allowing one smallness choice to close all orders simultaneously.
The induction proves invertibility of each new Jacobian using estimates from earlier levels. It does not assume the next Jacobian is invertible in order to estimate it. Nor does it require each finite-stage map to be globally injective. (OpenAI, 2026)
🏷️ All-pairs distance bounds and openness of the limit
The increments satisfy a uniform summable value bound, giving a continuous limit
where can be made arbitrarily small. Uniform convergence alone would not preserve a lower Lipschitz bound, so the proof selects a scale separately for each pair.
Take in a sufficiently small final ball, and choose a dyadic radius with
where the fixed large constant is chosen before the final magnification. For , normalized harmonic approximation gives between and .
The straight segment from to lies in a central ellipsoid whose entire preimage is inside the working region. Taylor’s theorem is therefore available along the whole segment. Its remainder is bounded by a constant times , hence by . The leading term has size comparable to , by the metric bound. The two limit tails contribute at most .
Choose first to control the Taylor error, then the initial magnification so that is small enough. The resulting estimates are
They apply to every pair in the final ball, with the ambient distance. The map is consequently injective and has a continuous inverse onto its image. Since already gives an open coordinate domain, invariance of domain applied to makes the image open.
All fixed constants depend only on . Returning from the magnified metric to the original one scales the final coordinate values by the same factor as distances, preserving the distortion . Only the radius of the chart depends on the particular space and point. (OpenAI, 2026)
🏷️ The full-measure chart region and reading connections
Taking the union of the chart domains gives an open set containing every -regular point. The known full-measure property of the regular set makes its complement null. Separability supplies a countable subcover. On overlaps, a transition map is a composition of an -Lipschitz map with the inverse of another, so it is -bi-Lipschitz.
The union may also contain points outside the exact regular locus. Thus the corollary does not assert that the exact regular locus itself is open.
The Alexandrov-curvature family introduces the RCD calculus and explains another passage from integrated estimates to a conclusion at every prescribed geometric object. Here the conclusion concerns every regular point and all pairs in its chart. The two articles use different curvature hypotheses and different analytic mechanisms.
The source review covers the theorem and introduction, selected harmonic and heat-matrix estimates, the telescoping volume defect, radial transport and sharp-projection arguments, the directional estimate, and the coordinate iteration and limiting-chart proof. The complete harmonic-normalization induction, heat-kernel comparison estimates, radial-invariance construction, and factorial inversion estimates were not independently verified. The claimed research theorem remains attributed to the manuscript.
🏷️ Key steps and proof outlines
Inverse increments are compared one matrix at a time
The heat Gram matrices decrease with scale, while their inverses increase. To estimate one inverse increment, conjugate its positive decrement by . The resulting matrix is positive and can be diagonalized for that single step; scalar inequalities for compare inverse growth with the normalized decrement. Undo the conjugation and sum inequalities of quadratic forms.
This does not require the matrices at different scales to commute. It also does not require to remain bounded: the cumulative inequalities compare all earlier corrections with the current . The directional pinching estimate supplies the additional summability needed for actual coordinate differences. (OpenAI, 2026)
The inverse transpose creates the desired metric increment
Set for . Differentiating gives
Consequently the linear term in the change of splits into the desired and the error . The leading part of is the positive form . Thus the update adds precisely the accumulated stretching prescribed by the Bochner mass, with all remaining terms explicitly identified.
Twice differentiating produces three terms:
where . Frozen anisotropic normalization controls each term by the same directional forcing. Since the next radius is half as large and , the normalized old second derivative contracts by at least one half. This gives the recurrence for stated above. (OpenAI, 2026)
Square summation avoids a false square-root summability assumption
The recurrence has the form . Convolution by is bounded on , so . The forcing squares are controlled by accumulated Bochner mass plus , hence by over any finite prefix.
The troublesome mixed error is now bounded by Cauchy–Schwarz against . It costs only . Summing directly would be invalid: a summable nonnegative sequence need not have summable square roots. This is the specific reason for tracking diagonal second derivatives and using a square-sum recurrence.
The resulting lower metric bound proves the next Jacobian invertible, closing the induction in the correct order. The final all-pairs estimates and openness argument concern the limiting map, rather than assuming global injectivity of every finite correction. Together they upgrade asymptotically Euclidean tangent information to an open coordinate neighborhood with uniform two-sided distance control.
🏷️ Manuscripts and verification scope
- Bi-Lipschitz Coordinates at Regular Points of Noncollapsed RCD Spaces — pinned manuscript and companion source.
No family scope page was present at lean/docs/357.md in the pinned snapshot. This does not establish that all related formalization code is absent. No Lean build, axiom audit, or manuscript-to-formal-statement equivalence check was performed for these notes.
OpenAI collection provides prerequisites and the reading sequence; coverage register records completed and pending families.