Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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.

A riemannian distance with no cross component finite value

Example

On M=R×{0,1} with metric dx2 on each component, d((x,i),(y,i))=∣x−y∣ and d((x,0),(y,1))=+∞.

Facts & Assumptions

Given: The two disjoint Euclidean lines with their disjoint-union smooth structure.

[F1]

Extended riemannian distance on a disconnected manifold: The extended Riemannian distance on arbitrary M is the componentwise Riemannian distance when two points are in the same component, and +∞ otherwise. Within each component use thm-riemannian-distance-is-a-metric. Components are open, since small coordinate balls are connected. A continuous curve cannot meet two components because its connected interval image is connected, so the cross-component curve family is empty, with inf⁡∅=+∞. This is an extended metric: if two endpoints are in different components, any third point is in a different component from at least one of them, so the triangle inequality has infinite right side. It is a finite metric precisely when there are no distinct components. Empty and singleton manifolds retain their unique distances.

[F2]

Newton–Leibniz needs only continuity on [a,b], differentiability on (a,b), and a Riemann-integrable extension of the interior derivative: Let a<b. Suppose G:[a,b]→R is continuous on [a,b] and differentiable on (a,b). If f:[a,b]→R is Riemann integrable and f(x)=G′(x)(a<x<b), then ∫abf=G(b)−G(a). No derivative of G at either endpoint is assumed, and the two endpoint values assigned to the integrable extension f do not enter the conclusion.

Verification

technique · direct
1.1F1given

The two lines are disjoint open-and-closed components; their usual charts give a Hausdorff second-countable smooth one-manifold and metric coefficient 1>0. A continuous path cannot meet both components, because their inverse images would separate its connected interval. Hence the cross-component admissible family is empty and its length infimum is +∞. In particular d((0,0),(0,1))=+∞.

2.1F1F2step 1.1∎

Within a component, an admissible path has length ∫∣γ′∣≥∣∫γ′∣=∣y−x∣, by Newton–Leibniz on its finitely many smooth pieces. The path t↦(x+t(y−x),i) for 0≤t≤1 attains this bound. The same-component infimum is therefore ∣y−x∣; for example d((0,0),(3,0))=3.

Source locator

Lee, pp. 337–338, connected distance and Euclidean calculation; cross-component infinity follows from the declared extended-distance convention.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

6 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources