Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)verified 2026-11-05 (gpt-6.1-sol)
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.

Discrete elements of the coset ring are generated by discrete cosets

Statement

Let d≥1. The coset ring of the additive topological group Rd is the smallest family of subsets containing every additive coset and closed under finite unions, finite intersections, and complements relative to Rd. Call a subset discrete when it is locally finite: every compact subset of Rd meets it in finitely many points. Then every discrete element of the coset ring belongs to the ring generated by the discrete cosets, where a ring of sets is closed under finite unions, intersections, and relative differences.

Facts & Assumptions

Given: d≥1, the coset ring C of Rd, and E∈C locally finite.

[A1]

Rd has its usual Euclidean topology and additive group law.

[A2]

E is generated from finitely many additive cosets by finite unions, intersections, and complements.

[A3]

Every compact set meets E in finitely many points.

Proof

1.1givenA1A2algebra

Put a finite Boolean expression for E in disjunctive normal form. Each nonempty cell has the form A∖⋃j=1mBj, where A and the Bj are cosets: intersecting positive cosets gives a coset or the empty set, and a cell with no positive literal uses A=Rd. Thus E is a finite union of such cells.

1.2givenA1A3algebra

We first prove the cover claim: if a non-discrete coset A=x+H is covered by a locally finite set F⊆A and finitely many cosets Bj of subgroups of H, each disjoint from F, then F=∅. Induct on the number k of distinct subgroups defining the Bj. If a subgroup K is locally finite in Rd, a compact neighborhood of 0 meets K in finitely many points, so shrinking it to exclude the nonzero points gives a neighborhood U with U∩K={0}. Choose a symmetric neighborhood V with V−V⊆U. Every compact set has a finite cover by translates of V, and each translate meets any coset of K in at most one point. Hence every discrete subgroup coset is locally finite. If every subgroup among the Bj were discrete, then their finite union with F would be locally finite, forcing A to be discrete. Therefore at least one defining subgroup, say K1, is non-discrete. If k=1 and y∈F, then y+K1⊆A cannot meet any Bj: a K1-coset meeting y+K1 equals it and would contain y, contrary to Bj∩F=∅. Thus y+K1⊆F, contradicting local finiteness of F because K1 is non-discrete. For k>1, the same argument shows that y+K1 is covered only by F and the cosets whose defining subgroups differ from K1. Translate by −y and intersect with K1. Each nonempty intersection with such a coset is a coset in K1 of the proper subgroup K1∩Kj; it is proper because otherwise that coset would contain y. The set F′=(F−y)∩K1 is locally finite and contains 0, and is disjoint from all these intersection cosets. The induction hypothesis inside the non-discrete group K1, with fewer than k distinct subgroups, says F′=∅, a contradiction. This proves the cover claim for every k.

2.1givenA1A2A3step 1.1step 1.2∎

Let C=A∖⋃jBj be a cell in step 1.1 and suppose C is nonempty and discrete. If A were non-discrete, then A=C∪⋃j(A∩Bj) would be a cover of the type in step 1.2: C is locally finite and each A∩Bj is a coset disjoint from C. Step 1.2 would force C=∅, contrary to the supposition. Thus A is a discrete coset. Every A∩Bj is then also a discrete coset, so C belongs to the ring generated by discrete cosets. Each cell in the finite union for E is a subset of the locally finite set E, hence is locally finite; applying this argument to every nonempty cell and taking their finite union proves the statement.

Remarks

The local-finiteness convention is explicit here so that sums of point masses on the discrete sets used in crystalline-measure arguments are locally finite. The statement is the finite-dimensional real-vector-space case needed in the c=1 source's reduction from coset-ring expressions to lattice cosets.

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources