Recommended
Defined mathematical notation
Browse 42 linked conservative definitions and 90 independently checked theorems without losing their exact first-order expansions.
Browse definitions and theorems →Actual divisor pairs · support reindexing · finite signed closure · Constructive arithmetic
MultiplicativePrefix(N,F) ∧ MultiplicativePrefix(N,G) ⇒ ∃H. DirichletTable(N,F,G,H) ∧ MultiplicativePrefix(N,H)
Construct a convolution table of normalized multiplicative signed prefixes and prove its complete coprime product law and positive-value uniqueness.
Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
Recommended
Browse 42 linked conservative definitions and 90 independently checked theorems without losing their exact first-order expansions.
Browse definitions and theorems →Exact certificate
Inspect all 5388 native tactic lines and 313 actual proof prerequisites with every definition fully expanded.
Open the exact edition →Focused route
Start at theorem MX0059 and follow only the lemmas and conservative definitions supporting dirichlet_convolution_multiplicative_exists_unique.
MX004A signed_support_reindex_sum_equal · MX002C signed_cartesian_product_sums_exists · MX0011 coprime_divisor_factor_pair_exists_unique · MX0057 dirichlet_convolution_multiplicative_values · MX0058 dirichlet_convolution_multiplicative_table · MX0059 dirichlet_convolution_multiplicative_exists_unique.953dc5ef340379b1e34883c2f9ab2181e91c872f5bbb7943c52b2fb70ce76959.