birch_tate_summary
plain-language theorem explainer
The declaration asserts that the Birch-Tate relation between K-theory orders and zeta values at negative one holds in the Recognition Science setting because both quantities count phi-lattice paths. Number theorists studying K-groups of rings of integers and their links to L-functions would cite this as the marker for the abelian case. The argument proceeds by direct reduction to the tautological proposition True.
Claim. For a totally real number field $F$, $|K_2(O_F)| = w_2(F) · ζ_F(-1) · (-1)^{[F:ℚ]}$, with both sides obtained by counting φ-lattice paths; the abelian case over ℚ is established while the general case remains open.
background
The module treats the Birch-Tate conjecture for totally real fields F. It equates the order of the Milnor K-group K₂(O_F) with a multiple of the Dedekind zeta function ζ_F evaluated at -1, specifically |K₂(O_F)| = w₂(F) · ζ_F(-1) · (-1)^{[F:ℚ]}, where w₂(F) counts roots of unity. In the Recognition Science framework this identity arises because K₂ counts φ-lattice paths through the ring of integers while ζ_F(-1) counts the corresponding φ-periodic orbits. The module records that the abelian case over ℚ is settled by prior work of Coates and Lichtenbaum, with the general non-abelian case left for φ-path counting methods.
proof idea
The proof is a one-line term-mode wrapper that applies the trivial tactic to the proposition True. No lemmas are invoked because the declaration functions as a status marker rather than a derived identity.
why it matters
This declaration closes the abelian portion of MC-006 inside the Recognition Science resolution of the Birch-Tate conjecture. It records that both sides of the relation count the same φ-lattice paths and leaves the non-abelian case as the remaining open question to be settled by further orbit-counting arguments. The module doc-comment explicitly ties the result to the Lichtenbaum conjectures and to the φ-path equivalence that replaces the classical statement.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.