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.
Finite-preparation residual budget and its remote-boundary limit
Statement
Fix arbitrary finite real constants and . Fix positive integers , a field with its usual absolute value, and the matrix space with any fixed norm . Let be a fixed family of maps, defined for all real ; linearity is not required. Let be a real sequence with , and let be differentiable curves. Derivatives are taken with respect to real time in real coordinates, using the real and imaginary entries when , and are reassembled as matrices in . Suppose for every .
For every fixed finite observation interval with , choose such that for all . For these indices define and . Then , , and . The limit superior is taken on this tail, reindexed as a sequence. This is a limit of error budgets; it asserts no convergence, existence or uniqueness of the matrix curves themselves.
Facts & Assumptions
Matrices in have entrywise vector-space operations. The vector space M_m × n(F) := F^ m × n of m by n matrices over a field, with entrywise operations
The chosen norm on is a nonnegative real-valued function, definite, absolutely homogeneous and subadditive. Normed vector space over an absolutely valued field
The real-coordinate derivative is the limit of the difference quotient; it exists exactly when all real coordinate derivatives exist. Applying this definition to the list of real entries, or real and imaginary entries, specifies the matrix derivative used here. The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral
The condition means that for each real , eventually . Convergence of a real sequence to zero means that for every positive rational , eventually its absolute value is less than . Divergence to +∞ and to -∞ Limits and Cauchy sequences of reals
Every nonempty real set bounded above has a real supremum, which is at most each of its upper bounds. Complete ordered field (least-upper-bound property)
For a real sequence , in the extended real line. Limit superior and limit inferior of a real sequence as infₙ sup_k ≥ n xₖ and supₙ inf_k ≥ n xₖ in ℝ̄
Proof
Given: The stated matrix space, norm, maps, curves and pointwise residual bound. Goal: Bound the residual uniformly on each fixed observation interval and then bound its tail limit superior.
By , there is with for all . Fix such an index. The derivative and both lie in , so their difference has a nonnegative real norm. For , . Since , the pointwise residual bound is at most . The interval is nonempty, so the set of residual norms is nonempty and bounded above. Its real supremum therefore exists and satisfies .
If , then on the chosen tail. Otherwise, for every positive real , divergence to gives eventually. Hence and eventually. In either case by the real-sequence limit definition.
Fix a positive real and choose so that for every . Step 1.1 gives throughout that tail. Thus , and the tail-infimum definition gives . This holds for every positive real , so . The argument imposes no relation between different curves and therefore asserts no convergence of them.
Depends on
- The vector space M_m × n(F) := F^ m × n of m by n matrices over a field, with entrywise operations
- Normed vector space over an absolutely valued field
- The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral
- Divergence to +∞ and to -∞
- Limits and Cauchy sequences of reals
- Complete ordered field (least-upper-bound property)
- Limit superior and limit inferior of a real sequence as infₙ sup_k ≥ n xₖ and supₙ inf_k ≥ n xₖ in ℝ̄
Dependency tree · 2 levels
Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.