Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-31
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.

An underdetermined consistent system has infinitely many exact solutions but a unique minimum-norm one

Example

Let

A=[101011],b=[11].

Then the exact solutions are

x(t)=[1−t1−tt](t∈F),

and the minimum-norm one is A+b=(1/3,1/3,2/3)T.

Facts & Assumptions

Given: The displayed matrix A and right-hand side b.

[L1]

If A has full row rank, then A+=A∗(AA∗)−1 (If A has full row rank, then A+=A∗(AA∗)−1).

Verification

technique · computation
1.1algebra

Solving Ax=b gives the one-parameter family x(t)=(1−t,1−t,t)T. Thus the system is consistent and has infinitely many exact solutions.

1.2L1algebra

Here AA∗=[2112],(AA∗)−1=13[2−1−12], so [L1] gives A+b=A∗(AA∗)−1b=[131323].

2.1L2step 1.1step 1.2∎

The vector of step 1.2 equals x(2/3) from step 1.1, so it is an exact solution. By [L2], it is the unique exact solution of minimum Euclidean norm.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

8 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.