Compute in your browser

p-adic valuation and ultrametric distance

Enter a prime p and three whole numbers or fractions. The valuation v_p(x) counts how many times p divides x; |x|_p is p^-v; the distance between two numbers is |a - b|_p. Exact arithmetic, no rounding.

Laws of Form: reduce a bracket expression

A pair of brackets is a mark. Two marks side by side are one mark (calling); a mark inside a mark is nothing (crossing). With no letters the page reduces the expression step by step; with letters (a to z, up to five) it shows the value for every choice of marked or void.

Try (()()) or ((a)a) or (a(b)).

More tools in your browser

• Reproduce: run the script a paper's computations were checked with.
• Living paper: read a paper with its equations explained on tap.
• Tree distance sandbox: cophenetic, Euclidean and ultrametric distances.
• Ultrametric convergence: variance collapse under coarse-graining.
• Error confinement: Bruhat-Tits error suppression.
• Staircase redundancy vs Archimedean codes.
• Virtual qubit showdown: an ultrametric tree against the surface code.
• All ten demos on qwav.org