Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generated
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 analytic evaluation from a supplied exact Jordan decomposition

Definition

Input a complex matrix A∈Cn×n, n≥1, an open Ω⊆C containing σ(A) and a holomorphic function f:Ω→C specified by exact derivative data of that same f on the spectrum, and an exact supplied Jordan certificate A=ZJZ−1 with J=diag⁡(Jd1(λ1),…,Jdr(λr)).

  1. Verify the dimensions, exact equality A=ZJZ−1, invertibility of Z, and the stated Jordan block pattern. If any check fails, return invalid-Jordan-certificate.
  2. For each block, form the finite sum Fi=∑k=0di−1f(k)(λi)Ndik/k! using the supplied exact derivatives. If a required value is absent, return missing-jet.
  3. Return Z diag⁡(F1,…,Fr) Z−1 with status exact.

All loops and matrix products have finite size. This is an exact-data evaluator; it makes no floating-point stability or complexity claim.

Depends on

Used by

Dependency tree · two levels

7 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