Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generated
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.

A pointwise one-dimensional FI-module that is not finitely generated

Statement refuted

Refuted claim: an FI-module over a field whose values VS are finite-dimensional for every finite set S is finitely generated.

The witness is built below: over a field k, take VS=k eS one-dimensional for every finite set S, with bijections acting as the identity identification of the lines and non-bijections acting as 0. Then dim⁡kVS=1 for all S, but no finite set of elements generates V (Span, finite generation and generation degree of an FI-module).

Facts & Assumptions

Given: A field k and, for every finite set S, the one-dimensional k-vector space VS:=k eS with distinguished nonzero vector eS; for an injection f ⁣:S→S′ let V(f) ⁣:VS→VS′ send eS↦eS′ when f is a bijection and eS↦0 otherwise.

[F1]

An FI-module over k is a covariant functor from the category of finite sets and injections to k-modules, so V(idS)=idVS and V(g∘f)=V(g)∘V(f) for composable injections (The category FI and FI-modules over a commutative ring).

[F2]

For a set Σ of supported elements (S,s), span⁡V(Σ)T is the k-span of the elements f∗(s) with (S,s)∈Σ and f ⁣:S→T an injection; V is finitely generated when span⁡V(Σ)=V for some finite Σ (Span, finite generation and generation degree of an FI-module).

[F3]

A composite of bijections is a bijection; if g∘f and f are bijections then g is a bijection; and if f is not a bijection then g∘f is not a bijection (Injection, surjection, bijection).

[F4]

For every n≥0 the set [n]={0,1,…,n−1} has exactly n elements (The finite symmetric group Sn, one-line notation, and cycle notation).

Counterexample

technique · direct
1.1F1F3givenalgebra

V is a functor: V(idS) sends eS to eS because idS is a bijection; and for composable injections f ⁣:S→T, g ⁣:T→U the two sides of V(g∘f)=V(g)V(f) agree on eS in each case — if f and g are bijections both sides send eS↦eU; if g fails to be a bijection then g∘f fails to be a bijection, so both sides are 0; and if f fails to be a bijection then g∘f fails to be a bijection and both sides are 0. Hence V is an FI-module and dim⁡kVS=1 for every finite set S.

1.2F3given

Suppose Σ={(S1,s1),…,(Sr,sr)} is a finite set of supported elements that generates V, with si∈VSi, and put M:=max⁡i∣Si∣ (if r=0, then span⁡V(∅)=0≠V, so r≥1). For every finite set T with ∣T∣>M, every injection f ⁣:Si→T satisfies ∣Si∣≤M<∣T∣, so f is not a bijection and f∗(si)=V(f)(si)=0.

2.1F2F4step 1.2

By the explicit description of the span, step 1.2 shows span⁡V(Σ)T=0 for every finite set T with ∣T∣>M. Taking T=[M+1], which has M+1>M elements, gives span⁡V(Σ)T=0 while VT=k eT≠0; hence span⁡V(Σ)≠V and no finite set of elements generates V.

3.1F2step 1.1step 2.1∎

Thus V has dim⁡kVS=1 for every finite set S by step 1.1, yet is not finitely generated by step 2.1: pointwise finite-dimensionality does not imply finite generation, and the refuted claim fails.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

20 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