Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Continuous linearized BVP operator and its conditioning

Definition

Let y∗∈C1([a,b],Rd) solve a square BVP, with f and B continuously differentiable on open neighborhoods of the trajectory and endpoint pair. Put A(t)=Dyf(t,y∗(t)), B1=D1B(y∗(a),y∗(b)), and B2=D2B(y∗(a),y∗(b)). Let

X=C1([a,b],Rd),∥v∥X=∥v∥∞+∥v′∥∞,

and

Z=C([a,b],Rd)×Rd,∥(g,q)∥Z=max⁡{∥g∥∞,∥q∥2}.

The continuous linearized BVP operator is the bounded linear map L:X→Z given by

Lv=(v′−Av, B1v(a)+B2v(b)).

It is boundedly invertible when it is bijective and its inverse L−1:Z→X has finite operator norm. That norm is the conditioning constant for the linearized BVP used in the local discretization theorem.

Depends on

Used by

Dependency tree · two levels

11 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