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 . The coset ring of the additive topological group is the smallest family of subsets containing every additive coset and closed under finite unions, finite intersections, and complements relative to . Call a subset discrete when it is locally finite: every compact subset of 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: , the coset ring of , and locally finite.
has its usual Euclidean topology and additive group law.
is generated from finitely many additive cosets by finite unions, intersections, and complements.
Every compact set meets in finitely many points.
Proof
Put a finite Boolean expression for in disjunctive normal form. Each nonempty cell has the form , where and the are cosets: intersecting positive cosets gives a coset or the empty set, and a cell with no positive literal uses . Thus is a finite union of such cells.
We first prove the cover claim: if a non-discrete coset is covered by a locally finite set and finitely many cosets of subgroups of , each disjoint from , then . Induct on the number of distinct subgroups defining the . If a subgroup is locally finite in , a compact neighborhood of meets in finitely many points, so shrinking it to exclude the nonzero points gives a neighborhood with . Choose a symmetric neighborhood with . Every compact set has a finite cover by translates of , and each translate meets any coset of in at most one point. Hence every discrete subgroup coset is locally finite. If every subgroup among the were discrete, then their finite union with would be locally finite, forcing to be discrete. Therefore at least one defining subgroup, say , is non-discrete. If and , then cannot meet any : a -coset meeting equals it and would contain , contrary to . Thus , contradicting local finiteness of because is non-discrete. For , the same argument shows that is covered only by and the cosets whose defining subgroups differ from . Translate by and intersect with . Each nonempty intersection with such a coset is a coset in of the proper subgroup ; it is proper because otherwise that coset would contain . The set is locally finite and contains , and is disjoint from all these intersection cosets. The induction hypothesis inside the non-discrete group , with fewer than distinct subgroups, says , a contradiction. This proves the cover claim for every .
Let be a cell in step 1.1 and suppose is nonempty and discrete. If were non-discrete, then would be a cover of the type in step 1.2: is locally finite and each is a coset disjoint from . Step 1.2 would force , contrary to the supposition. Thus is a discrete coset. Every is then also a discrete coset, so belongs to the ring generated by discrete cosets. Each cell in the finite union for is a subset of the locally finite set , 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 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.