Alphabeta Math
ExampleConstruction: AI-adaptedVerification: Not suppliedSession-authored (Fable 5 assisted)audited 2026-07-31
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The Möbius function on the divisor poset of 1212 and its agreement with μ(1),μ(2),μ(3),μ(4),μ(6),μ(12)\mu(1),\mu(2),\mu(3),\mu(4),\mu(6),\mu(12)

Example

The positive divisors of 1212 are 1,2,3,4,6,121,2,3,4,6,12. In the divisibility order (The divisibility poset of positive integers), the covers are

12,13,24,26,36,412,612.1\lessdot2,\quad1\lessdot3,\quad2\lessdot4,\quad2\lessdot6,\quad3\lessdot6,\quad4\lessdot12,\quad6\lessdot12.

1[1]2[¡1]3[¡1]4[0]6[1]12[0]nodelabel:d[¹j(1;d)]

For every comparable aba\mid b, The number-theoretic Möbius function is the poset Möbius function of divisibility: μ(n)=μ(1,n)\mu(n)=\mu_{\mid}(1,n) gives μ(a,b)=μ(b/a)\mu_{\mid}(a,b)=\mu(b/a). Hence the full table is obtained from

μ(1)=1,μ(2)=1,μ(3)=1,μ(4)=0,μ(6)=1,μ(12)=0.\mu(1)=1,\quad \mu(2)=-1,\quad \mu(3)=-1,\quad \mu(4)=0,\quad \mu(6)=1,\quad \mu(12)=0.

In particular, the row from 11 is (1,1,1,0,1,0)(1,-1,-1,0,1,0) in the divisor order listed above. The recurrence checks the less immediate values: 111+μ(1,6)=01-1-1+\mu(1,6)=0 gives μ(1,6)=1\mu(1,6)=1, and 111+0+1+μ(1,12)=01-1-1+0+1+\mu(1,12)=0 gives μ(1,12)=0\mu(1,12)=0 (The Möbius recurrence: μP(x,x)=1\mu_P(x,x)=1 and both interval sums of μP\mu_P vanish when x<yx<y).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 58 results over 13 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources