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.
Graph density and outward orientation
Example
For a subgraph in , the boundary chart has and . If , both factors are constant. In , the patch , , has area and upward flux 1 for . Assume the surface-measure convention .
Facts & Assumptions
Given: Assume . Use the subgraph , and then the affine function and unit-square patch specified in the Example.
The graph density and outward normal are well defined. (Chart and partition independence of surface measure).
Verification
The tangent columns are , so and F1 gives density . The vector has zero dot product with each tangent column, length , and positive last component. It points out of , as moving in its direction increases to first order by . Dividing by its length and multiplying by the density proves .
For affine h, , so and . In the stated instance , giving , determinant , and . Integration over the unit square gives area and flux . For the upper unit hemisphere, on . Here , so and ; its last component is positive and it is the radial outward unit vector. The equator is outside this graph. Rotated full-sphere graph charts cover it in an atlas of the full sphere, but no graph chart contained in the closed upper hemisphere covers an equator point.
Source notes
Hunter §1.10.3, graph surface element and Example 1.43, printed p. 16 (PDF p. 22). The affine numerical instance is computed here.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
8 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
- Hunter, Notes on Partial Differential Equations (standard reference, not scraped)