Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21
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 Picard operator and Picard iterates on a closed ball of continuous curves

Definition

Fix n∈N with n≥1, h≥0, J=[t0−h,t0+h], an initial state x0∈Rn, and a radius r>0. Let

Br:={x∈C(J,Rn):sup⁡t∈J∥x(t)−x0∥2≤r}.

Let DF⊆R×Rn be open and let F:DF→Rn be continuous. The domain of the Picard operator on Br consists of those x∈Br whose whole graph {(s,x(s)):s∈J} lies in DF. For such a curve, continuity makes s↦F(s,x(s)) integrable on every interval with endpoints t0,t∈J, and its Picard image is

(Tx)(t):=x0+∫t0tF(s,x(s)) ds.

The operator maps into C(J,Rn); it is a self-map of Br only when its image is known to remain in that ball. Starting from x(0)(t):=x0, define x(m+1):=Tx(m) inductively whenever x(m) is defined and lies in the operator domain; if that condition first fails, no later iterate is defined. When a separate invariant-ball result makes T:Br→Br a total self-map, The recursion theorem supplies the entire sequence. Every fixed point satisfies the corresponding Volterra equation. When h>0, it is exactly a solution of the IVP by A first-order initial value problem is equivalent to its Volterra integral equation; for h=0 the fixed-point equation remains defined, but no derivative on the isolated one-point domain is asserted.

Depends on

Used by

Dependency tree · two levels

36 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