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.
Downward flux through the graph over the unit square
Example
For , the downward flux through the graph over is . The upward flux is .
Facts & Assumptions
Given: The graph function and vector field .
The downward area vector of a graph is (Surface area, scalar integrals, and flux over a graph), and derivative algebra gives (Sums, scalar multiples, products and quotients: , , , and when ).
Jordan-Fubini and the fundamental theorem evaluate polynomial integrals over the unit square (Fubini over a bounded Jordan set when all but a content-zero family of sections are integrable, The second fundamental theorem: if is differentiable on with and is integrable, then ).
Verification
On the graph, , and its dot product with the downward area vector is .
By [L2], the integral is .
Reversing the orientation negates flux, so the upward value is .
Depends on
- Surface area, scalar integrals, and flux over a $C^1$ graph
- Fubini over a bounded Jordan set when all but a content-zero family of sections are integrable
- The second fundamental theorem: if $G$ is differentiable on $[a,b]$ with $G' = f$ and $f$ is integrable, then $\int_a^b f = G(b)-G(a)$
- Sums, scalar multiples, products and quotients: $(f+g)'(c) = f'(c) + g'(c)$, $(\alpha f)'(c) = \alpha f'(c)$, $(fg)'(c) = f'(c)g(c) + f(c)g'(c)$, and $(f/g)'(c) = \bigl(f'(c)g(c) - f(c)g'(c)\bigr)/g(c)^{2}$ when $g(c) \ne 0$
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
34 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
- University of Toronto MAT237 notes, Section 5.3, Basic Problem 3 (standard reference, not scraped)