Digamma function¶

The logarithmic derivative ψ(z)=Γ′(z)/Γ(z) of the gamma function, extending shifted harmonic-number relations to complex arguments.

Version: v1 · 2026-09-08 · History
Domain-specific #: 4176
Origin domain: special functions
Subdomain: special functions

Core Idea¶

The digamma function is the first polygamma function and satisfies ψ(z+1)=ψ(z)+1/z, reflection and multiplication formulas, meromorphic continuation, and standard asymptotic expansions. Logarithmic differentiation converts the gamma functional equation into a recurrence; analytic continuation supplies poles at nonpositive integers and series or asymptotics support evaluation elsewhere. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

Scope of Application¶

Digamma function belongs to special functions and is useful where the analyst can specify the typed special functions carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the function is defined as the logarithmic derivative of a specified gamma branch and values respect its recurrence, poles, and analytic-continuation convention. The scope is broad within that domain but bounded by the need for the function is defined as the logarithmic derivative of a specified gamma branch and values respect its recurrence, poles, and analytic-continuation convention. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the function is defined as the logarithmic derivative of a specified gamma branch and values respect its recurrence, poles, and analytic-continuation convention the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Digamma function can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Digamma function. Digamma function compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed special functions carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the function is defined as the logarithmic derivative of a specified gamma branch and values respect its recurrence, poles, and analytic-continuation convention independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of special functions because they reuse the typed special functions carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Logarithmic differentiation converts the gamma functional equation into a recurrence; analytic continuation supplies poles at nonpositive integers and series or asymptotics support evaluation elsewhere., and type the carrier, state every parameter and convention in the definition, test that the function is defined as the logarithmic derivative of a specified gamma branch and values respect its recurrence, poles, and analytic-continuation convention, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Digamma function Domain-specific

Parents (1) — more general patterns this builds on

Digamma function is a kind of Transformation Prime

The proposed strict upward parent is prime:transformation.

Hierarchy path (1) — routes to 1 parentless root

Digamma function → Transformation → Function (Mapping)

Neighborhood in Abstraction Space¶

Digamma function sits in a moderately populated region (55^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Fourier, Transform & Operator Methods (19 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08