student_t_logpdf

std.stats.student_t_logpdf · Level L5

The log-density of Student's t distribution with ν degrees of freedom: log Γ((ν+1)/2) − log Γ(ν/2) − ½·log(νπ) − ((ν+1)/2)·log1p(x²/ν).

log Γ((ν+1)/2) − log Γ(ν/2) − ½ log(νπ) − (ν+1)/2·log1p(x²/ν)

Signature

student_t_logpdf(x: f64[n], nu: f64[]) → f64[n]

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.

xf64[n]nuf64[]1.00.53.14159Multiplyx2Multiplyh0Addnu1MultiplynupiDividerLogGammalg0Multiplyh1LoglognupiLog1pl1pLogGammalg1MultiplyhlMultiplytailSubtracts1Subtracts2Subtractlogplogpf64[n]
  • input
  • operation
  • constant
  • call
  • output

Verification

  • Signature proven by NOVA’s shape solver, for every size.
  • Agrees with the reference log of Γ((ν+1)/2)/(√(νπ)·Γ(ν/2))·(1 + x²/ν)^(−(ν+1)/2) to 80 digits (100-digit arithmetic), on all 40 test cases.
  • All 158 float64 results inside the running error bound; the closest uses 12% of it.
  • Interpreter and NumPy backend return bit-identical results.
  • At float32 too: the 40 test cases rounded to float32, and 40 of them inside the running error bound at u = 2⁻²⁴; the closest uses 12% of it.
Accuracy in detail
correctly rounded (the float64 nearest the exact value)
61%
largest error, in units in the last place
1.66

Identity

Calls
—
Called by
—
sha256:2d676daf2ecbc2306367f1fdbc513f50484e941dcafbf095458ed1dc295a1564

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

Control handle

Symbol
Ω:std.stats.student_t_logpdf · Ω:student_t_logpdf
Pins
sha256:4ccf61d8a424a56480637dae3040e1f80293b434965d1ac888bcfe912eaa25d2this graph alone
Evidence
sha256:f280854bb55549d4b491e8878f0750263d007fb21207d7d4c5b6e81a412b9387the 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.