reducesTo

P3630
predicate

Indicates that one expression, structure, or state can be transformed or simplified into another, typically more basic or canonical, form.

All labels observed (8)

Label Occurrences
reducesTo canonical 64
reductionType 5
usesReductionType 3

Description generation (PDg)

The one-sentence description above was generated by prompting gpt-5.1 with the predicate name and this instruction.

Instruction
Given a predicate that represents a relationship or action between entities, generate a one-sentence description explaining its meaning.  
# Instructions
Focus on describing the relationship, not the entities themselves. 
# Response Format
Begin the description with \' Indicates...\'
Input
Predicate: reducesTo
Generated description
Indicates that one expression, structure, or state can be transformed or simplified into another, typically more basic or canonical, form.

Sample triples (78)

Subject Object
theory of relativity Newtonian mechanics at low velocities ⓘ
Bose–Einstein statistics Maxwell–Boltzmann statistics in classical limit ⓘ
Einstein field equations Newtonian gravity in the weak-field limit ⓘ
Fermi–Dirac statistics Maxwell–Boltzmann statistics at high temperature and low density ⓘ
Planck radiation law Rayleigh–Jeans law at low frequencies ⓘ
Planck radiation law Wien approximation at high frequencies ⓘ
Lorentz transformation Galilean transformation in the limit of low velocities ⓘ
Rényi entropy Shannon entropy when α → 1 ⓘ
Tsallis entropy Shannon entropy when q → 1 ⓘ
Eliashberg theory BCS theory in weak-coupling limit ⓘ
Kerr metric Schwarzschild metric when spin parameter a = 0 ⓘ
Reissner–Nordström metric Schwarzschild metric when Q = 0 ⓘ
Bardeen black hole model Schwarzschild black hole for vanishing charge ⓘ
Kerr–Newman black hole Kerr black hole when charge is zero ⓘ
Kerr–Newman black hole Reissner–Nordström black hole when angular momentum is zero ⓘ
Kerr–Newman black hole Schwarzschild black hole when charge and angular momentum are zero ⓘ
Riemann–Liouville integral n-fold classical integral when α is a positive integer n ⓘ
Ricci scalar twice the Gaussian curvature in 2-dimensional Riemannian manifolds (up to conventions) ⓘ
Klein–Nishina formula Thomson cross section in the low‑energy limit ⓘ
Yukawa potential Coulomb potential when mediator mass goes to zero ⓘ
Lemaître–Tolman metric FLRW metric under spatial homogeneity ⓘ
Pauli equation Schrödinger equation in absence of spin ⓘ
Pauli equation Schrödinger equation when magnetic field is zero ⓘ
Successive Over-Relaxation Gauss–Seidel method when ω = 1 ⓘ
Hamiltonian (time translation generator) classical Hamiltonian in ℏ → 0 limit ⓘ
HOMFLY-PT polynomial Alexander polynomial under specialization ⓘ
HOMFLY-PT polynomial Jones polynomial under specialization ⓘ
NP-completeness polynomial-time many-one reduction via predicate surface "usesReductionType" ⓘ
NP-completeness Karp reduction via predicate surface "usesReductionType" ⓘ
Jacobi bracket Poisson bracket when the Jacobi structure is exact ⓘ
Born–Infeld electrodynamics Maxwell electrodynamics in the weak-field limit ⓘ
Ayón-Beato–García regular black hole solutions Reissner–Nordström black hole in weak-field limit ⓘ
Tsallis divergence Kullback–Leibler divergence when q → 1 ⓘ
Riemann–Stieltjes integral Riemann integral when integrator is identity function ⓘ
Riemann–Stieltjes integral Riemann integral when integrator is x ↦ x ⓘ
Potts model Ising model when q = 2 ⓘ
Valiant–Vazirani theorem randomized polynomial-time reduction via predicate surface "reductionType" ⓘ
XXZ spin chain XX spin chain ⓘ
XXZ spin chain XXX Heisenberg spin chain ⓘ
Moyal bracket Poisson bracket in the classical limit ⓘ
LTB metric FLRW metric for homogeneous density and curvature ⓘ
t-J model Heisenberg model at half-filling ⓘ
Timoshenko beam theory Euler–Bernoulli beam theory for slender beams with small shear effects ⓘ
Proca equation Maxwell equations in the zero-mass limit ⓘ
Dirac Hamiltonian Pauli Hamiltonian in the nonrelativistic limit ⓘ
Dirac Hamiltonian Schrödinger Hamiltonian in appropriate limit ⓘ
NP-hardness polynomial-time many-one reduction via predicate surface "reductionType" ⓘ
NP-hardness polynomial-time Turing reduction via predicate surface "reductionType" ⓘ
Cook–Levin theorem polynomial-time many-one reduction via predicate surface "usesReductionType" ⓘ
Max-3-SAT 3-SAT via predicate surface "hasReductionFrom" ⓘ