Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Pointwise nonlinearities, neighborhood pooling, subgroup sampling, and coset pooling

Definition

Let G be a group and let F:G→RC be a feature map with C channels. A pointwise nonlinearity determined by ν:R→R is NνF, where (NνF)(g)c=ν(F(g)c). For a nonempty finite set U⊆G, non-strided neighborhood max pooling is PUF, where (PUF)(g)c=max⁡u∈UF(gu)c; the output is still indexed by G. For a subgroup H≤G, subgroup sampling is the restriction RHF=F∣H, indexed by H.

The left-coset set is G/H={gH:g∈G}, where gH={gh:h∈H}. Its left G-action is a⋅(gH)=(ag)H. For finite H, left-coset max pooling is the map QHF:G/H→RC given by (QHF)(gH)c=max⁡h∈HF(gh)c. All maxima are taken separately in each channel. When H=G is finite, G/H has one element and QHF is a group-invariant summary.

Facts & Assumptions

Given: A group G, a finite subgroup H≤G, a nonempty finite U⊆G, and a feature map F:G→RC. Verify that the coset action and pooling formulas are well-defined.

[F1]

Subgroup: A subgroup contains the identity and is closed under multiplication and inverses.

[F2]

Left and right cosets gH and Hg of a subgroup: The left coset represented by g is gH={gh:h∈H}.

[F3]

Left group actions, transitive actions, and faithful actions: A left action satisfies e⋅z=z and (ab)⋅z=a⋅(b⋅z) for each acted-on element z.

Proof

1.1givenF1F2F3algebra

If gH=g′H, then g′=g′e∈g′H=gH, so [F2] gives g′=gh0 for some h0∈H. By [F1], h0H⊆H; conversely, every k∈H equals h0(h0−1k) with h0−1k∈H, so H⊆h0H. Hence h0H=H and (ag′)H=(agh0)H=ag(h0H)=agH, proving that a⋅(gH)=(ag)H is independent of the representative. It satisfies the identity and composition laws in [F3] because eg=g and (ab)g=a(bg). Thus it is a left action on G/H.

1.2givenF1F2algebra

If g′=gh0 with h0∈H, then h0H=H: closure gives h0H⊆H, and for k∈H, k=h0(h0−1k)∈h0H by [F1]. Hence {g′h:h∈H}={gh:h∈H}, so the componentwise maximum defining QHF(gH) is independent of the representative.

2.1givenF1step 1.1step 1.2algebra∎

By [F1], H contains the identity, so H and the given set U are nonempty and finite. Each displayed maximum therefore exists in R; the pointwise operation and subgroup restriction are also functions on their stated domains. Thus all four operators in the Definition are well-defined.

Depends on

Used by

Dependency tree · two levels

16 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources