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.
The closed half-space as a manifold with boundary
Example
For , the identity chart on gives and ; at the face, inward vectors have positive last component. For , is a point with empty boundary.
Facts & Assumptions
Given: An integer , with and as in the stated convention.
The model half-space is for , with face ; for , and its face is empty (Euclidean upper half-space and its boundary).
Boundary charts define the smooth structure, and face versus relative-interior points is invariant under smooth changes of boundary chart (Topological manifolds with boundary; Smooth charts, atlases, and structures with boundary; Smooth invariance of the manifold boundary).
At a face point, the last coordinate classifies tangent vectors as inward, outward, or boundary-tangent according as it is positive, negative, or zero (Inward, outward, and boundary-tangent vectors).
Verification
For , the identity map is a global boundary chart on ; for , the unique map identifies the point with . These charts give the asserted smooth manifolds with boundary.
For , [L1] and [L2] identify the intrinsic interior with and the intrinsic boundary with . The identity chart identifies every tangent space with , and [L3] makes the inward vectors at the face precisely those with positive last component. For , [L1] makes the unique point interior and the boundary empty.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
13 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
- Ioan Mărcuț, Manifolds (2017 lecture notes), §§14.5, 15.1 (standard reference, not scraped)
- Will Merry, Differential Geometry (2021), Lecture 24 (standard reference, not scraped)