inverse

std.linalg.inverse · Level L3

The inverse of A: Solve against the identity, which is built from two Iotas.

A⁻¹ = solve(A, I)

Signature

inverse(A: f64[k, k]) → f64[k, k]

Structure

The function as NOVA stores it: one box per input, operation and output, and arrows that carry values. A double border marks another library function this one runs — called once, or by Scan once per element; select it to open that function.

Af64[k, k]Iotaeye_rIotaeye_cEqualeyeSolveAinvAinvf64[k, k]
  • input
  • operation
  • constant
  • call
  • output

Verification

  • Signature proven by NOVA’s shape solver, for every size.
  • Equal to the reference np.linalg.inv(A) in exact rational arithmetic, on all 40 test cases.
  • All 716 float64 results inside the running error bound; the closest uses 1% of it.
  • Interpreter and NumPy backend return bit-identical results.
  • At float32 too: the 40 test cases rounded to float32, and 35 of them inside the running error bound at u = 2⁻²⁴; the closest uses <1% of it. Uncertified, too ill-conditioned at float32 for a finite bound: 5.
Accuracy in detail
correctly rounded (the float64 nearest the exact value)
37%
largest error, in units in the last place
2.1e+4

Large ulp counts appear where a result is tiny next to the numbers it is computed from (after cancellation, for example), so one unit in the last place is tiny too; the absolute error is still inside the bound. Results within their own error of zero are not counted.

Identity

Calls
—
Called by
sha256:bc6ce34c70f4d04ee2a2e3ef4302fdb7fa04f6acbb0a1db49b2317e721cc8009

The semantic hash of the graph. It changes when the program changes, and never when only its documentation does.

Control handle

Symbol
Ω:std.linalg.inverse · Ω:inverse
Pins
sha256:ddbfe67377de0296caea36059d2baa5ed0fbebad6f07d038da6c7367de0dc542this graph alone
Evidence
sha256:5c2ff1d5729cebce1b0218fa6b1d653fe1142c961deaa0ec047c69ee60a6a7d3the hash of its verification record
Needs
no capability: a pure function

Through NOVA’s control layer, the symbol launches this function only while the program still matches what it pins: a change to this graph, or to any graph it reaches, needs a migration first.

ΣEML 2026

Efficient New Language — a high-density semantic overlay for humans and AI agents.

This site’s demos run on the real EML toolchain, in your browser.

© 2026 EveMissLab (一言諾科技有限公司) / Neo.K. All rights reserved.