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.
Real-analytic maps between open subsets of the coordinate plane
Definition
A smooth map on an open set is real analytic when, at every , both components equal their total-degree Taylor series on some neighbourhood of .
More explicitly, write multi-indices, their factorials, and the derivatives as in maps and multi-index derivative notation in Euclidean space and The factorial and the falling factorial , defined by recursion in . For each there must be a neighbourhood on which, for with ,
Each inner sum is finite (Finite sums and finite products, by recursion), and each outer sum is a real series in the sense of Series, partial sums, convergence and the sum, divergence, and the tail series. The coordinate functions and are the components of the map into under the convention of Vector-valued functions , their limits and continuity, with the dictionary to the metric notions. Equality with the displayed series includes convergence to the stated component value; convergence is not presumed merely from smoothness.
Depends on
- $C^k$ maps and multi-index derivative notation in Euclidean space
- Vector-valued functions $f : A \to \mathbb{R}^m$, their limits and continuity, with the dictionary to the metric notions
- The factorial $n!$ and the falling factorial $n^{\underline{k}}$, defined by recursion in $\mathbb{N}$
- Finite sums and finite products, by recursion
- Series, partial sums, convergence and the sum, divergence, and the tail series
Used by
Dependency tree · two levels
50 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
- Michael Taylor, Introduction to Analysis in Several Variables, Ch. 2 §2.2, Exercise 4 (standard reference, not scraped)