Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: 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-time linear state-space model

Definition

Assume the Axiom of Countable Choice, so the usual Lebesgue-measurable sets on R form a complete measure space with Lebesgue measure λ. Every bounded interval is Lebesgue measurable, and any interval is the countable union of its bounded intersections with [−n,n]; since the Lebesgue-measurable sets form a sigma-algebra, I is measurable and λ restricts to I. Let F be R or C, let I⊆R be an interval with t0∈I, and let N,m,p≥1 be finite. A continuous-time linear state-space model consists of matrices A∈FN×N, B∈FN×m, C∈Fp×N, D∈Fp×m, an initial value x0∈FN, and an input u:I→Fm whose real and imaginary coordinates are Lebesgue measurable and integrable on every compact subinterval of I. A state trajectory is a function x:I→FN whose real and imaginary coordinates are absolutely continuous on every compact subinterval of I (with absolute continuity defined by the ε–δ condition on finite families of disjoint subintervals), with x(t0)=x0 and x′(t)=Ax(t)+Bu(t) outside a Lebesgue-null subset of I. Its output is y(t)=Cx(t)+Du(t). The term Du(t) is the direct input-to-output term and is separate from the state contribution Cx(t).

Depends on

Used by

Dependency tree · two levels

37 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