Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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.

Random Simon-oracle distribution for a classical lower bound

Definition

Fix n≥1 and m≥n−1, and put L=2m and C=2n−1. Choose s uniformly from the 2n−1 nonzero binary masks. Let Cs be the set of address pairs {x,x⊕s}. Conditional on s, choose uniformly an injection λ:Cs→{0,1}m and define the total oracle fs,λ(x)=λ({x,x⊕s}).

The sample space consists of all pairs (s,λ) with equal weight. There are C cosets and L≥C labels, so each s admits exactly L(L−1)⋯(L−C+1) injections; this number does not depend on s. Thus the marginal on s is uniform and the conditional label assignment is uniform without replacement.

Facts & Assumptions

Given: Integers n≥1, m≥n−1, and the hidden-XOR-period promise.

[F1]

Simon hidden-XOR-period promise: a valid Simon function is total and satisfies f(x)=f(y) exactly when y=x or y=x⊕s for its unique nonzero mask.

[F2]

Finite probability spaces, outcome weights, events, and event probabilities: a finite probability space is a finite outcome set with nonnegative weights summing to one.

Verification

1.1givenF1algebra

For every nonzero s, the map x↦x⊕s is a fixed-point-free involution, so its 2n addresses split into C=2n−1 two-element cosets. Since m≥n−1, L=2m≥C, and the number of injections from a C-element set into an L-element set is L(L−1)⋯(L−C+1)>0, the sample space is finite and nonempty.

2.1givenF2step 1.1algebra

Give every pair (s,λ) weight 1/((2n−1)L(L−1)⋯(L−C+1)). There are exactly the denominator's many pairs, so the weights are nonnegative and sum to one by [F2]. Because the number of injections is constant for each s, the induced hidden mask is uniform and, conditional on it, every injection is equally likely.

3.1givenF1step 1.1algebra∎

If x⊕s=y, the two addresses lie in the same coset and receive the same label. Conversely, if fs,λ(x)=fs,λ(y), injectivity of λ gives equal cosets, hence y=x or y=x⊕s. Since s≠0, this is exactly the Simon promise with unique hidden mask s.

Depends on

Used by

Dependency tree · two levels

8 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